Crossing number of simultaneous embedding of two planar graphs with restriction (Chinsese)

Journal of East China Normal University(Natural Sc ›› 2009, Vol. 2009 ›› Issue (1): 7-12.

• Article • Previous Articles Next Articles

Crossing number of simultaneous embedding of two planar graphs with restriction (Chinsese)

LU Jun-jie¹, REN Han²

1. Department of Mathematics, Shanghai jiaotong University, Shanghai 200062, China; 2.Department of Mathematics, East China Normal University, Shanghai 200062, China

Received:2008-03-01 Revised:2008-05-13 Online:2009-01-25 Published:2009-01-25
Contact: LU Jun-jie

Abstract

Abstract: Consider a red planar graph and a green planar graph
simutaneously $2$-cell embedded on a surface. With some restriction,
a red edge can cross a green edge. This paper studied the minimum
number of these red-green crosses by using technique of integer
programming, and some results are obtained.

Key words: crossing number, partition, edge-connectivity, planar graph, crossing number, partition, edge-connectivity

CLC Number:

O157.5

LU Jun-jie;REN Han. Crossing number of simultaneous embedding of two planar graphs with restriction (Chinsese)[J]. Journal of East China Normal University(Natural Sc, 2009, 2009(1): 7-12.

[1]	Wenxin LIU, Peng CAI. Partition-based concurrency control in a multi-master database [J]. Journal of East China Normal University(Natural Science), 2021, 2021(5): 84-93.
[2]	QI Lin-ming, LI Jin-bo, LI Wei-qi. 3-hued coloring of planar graphs [J]. Journal of East China Normal University(Natural Sc, 2017, 2017(1): 32-37.
[3]	WANG Min, PENG Cheng-chen, LI Rong-rong, PENG Yu-wei. Data correlation-based partition approach for distributed deputy database [J]. Journal of East China Normal University(Natural Sc, 2016, 2016(5): 45-55.
[4]	WANG Xiao-tong, FANG Jun-hua, ZHANG Rong. Distributed and scalable stream join algorithm [J]. Journal of East China Normal University(Natural Sc, 2016, 2016(5): 81-88.
[5]	YUE Ming-shi. Cells of the weighted Coxeter group\\ $\textbf{(}\widetilde{\bm C}_{\bm n},\widetilde{\bm l}_{\textbf{2}\bm n}\textbf{)}$ in a certain quasi-split case [J]. Journal of East China Normal University(Natural Sc, 2016, 2016(4): 1-10.
[6]	YUE Ming-Shi. Cells of the weighted Coxeter group (C3,l6) [J]. Journal of East China Normal University(Natural Sc, 2016, 2016(1): 27-38.
[7]	WEI Shen,SUN Guang-zhong,XIE Xing. Dynamic trajectory anonymization in location based services [J]. Journal of East China Normal University(Natural Sc, 2015, 2015(5): 104-115.
[8]	YUE Ming-shi. Cells of the weighted Coxeter group C_n [J]. Journal of East China Normal University(Natural Sc, 2015, 2015(3): 38-46.
[9]	YUE Ming-shi. Cells of the affine Weyl group $\widetilde{\bm C}_{\bm n}$ in quasi-split case [J]. Journal of East China Normal University(Natural Sc, 2014, 2014(3): 77-92.
[10]	YUE Ming-shi. Cells of the affine Weyl group $\widetilde{\bm C}_{\bm 4}$ in quasi-split case [J]. Journal of East China Normal University(Natural Sc, 2013, 2013(1): 61-75.
[11]	YUAN Xiu-hua. On the crossing numbers of K_2,3 V C _n [J]. Journal of East China Normal University(Natural Sc, 2011, 2011(5): 21-24.
[12]	NI Wei-ping. Edge colorings of planar graphs with maximum degree five [J]. Journal of East China Normal University(Natural Sc, 2011, 2011(2): 32-38.
[13]	NI Wei-ping. Edge coloring of planar graphs for maximum degree six without adjacent k-cycles [J]. Journal of East China Normal University(Natural Sc, 2010, 2010(5): 20-26.
[14]	NI Wei-ping. Some sufficient conditions for a planar graph of maximum degree four to be Class 1 [J]. Journal of East China Normal University(Natural Sc, 2010, 2010(3): 85-91.
[15]	HUANG Yuan-qiu;WANG Jing. Survey of the crossing number of graphs [J]. Journal of East China Normal University(Natural Sc, 2010, 2010(3): 68-80.

Crossing number of simultaneous embedding of two planar graphs with restriction (Chinsese)

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics

Comments