Browse > Article
http://dx.doi.org/10.4134/BKMS.b160296

ON THE MINIMUM WEIGHT OF A 3-CONNECTED 1-PLANAR GRAPH  

Lu, Zai Ping (Center for Combinatorics LPMC-TJKLC Nankai University)
Song, Ning (Center for Combinatorics LPMC-TJKLC Nankai University)
Publication Information
Bulletin of the Korean Mathematical Society / v.54, no.3, 2017 , pp. 763-787 More about this Journal
Abstract
A graph is called 1-planar if it can be drawn in the Euclidean plane ${\mathbb{R}}^2$ such that each edge is crossed by at most one other edge. The weight of an edge is the sum of degrees of two ends. It is known that every planar graph of minimum degree ${\delta}{\geq}3$ has an edge with weight at most 13. In the present paper, we show the existence of edges with weight at most 25 in 3-connected 1-planar graphs.
Keywords
1-planar graph; weight; light edge;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 A. Kotzig, Contribution to the theory of Eulerian polyhedra, Mat.-Fyz. Caspis. Slovensk. Akad. Vied (Math. Slovaca) 5 (1955), 101-113.
2 X. Zhang, Light 3-cycles in 1-planar graphs with degree restrictions, Bull. Korean Math. Soc. 51 (2014), no. 2, 511-517.   DOI
3 X. Zhang and J. Wu, On edge colorings of 1-planar graphs, Inform. Process. Lett. 111 (2011), no. 3, 124-128.   DOI
4 X. Zhang and J. Wu, On edge colorings of 1-planar graphs without adjacent triangles, Inform. Process. Lett. 112 (2012), no. 4, 138-142.   DOI
5 J. A. Bondy and U. S. R. Murty, Graph Theory, Springer, Berlin, 2008.
6 O. V. Borodin, Solution of the Ringel problems on vertex-face coloring of planar graphs and coloring of 1-planar graphs, Metody Discret. Anal. 41 (1984), 12-26.
7 O. V. Borodin, On the total coloring of planar graphs, J. Reine Angew. Math. 394 (1989), 180-185.
8 O. V. Borodin, A. V. Kostochka, A. Raspaud, and E. Sopena, Acyclic colouring of 1-planar graphs, Discrete Math. 114 (2001), no. 1-3, 29-41.   DOI
9 J. Czap and D. Hudak, On drawings and decompositions of 1-planar graphs, Electron. J. Combin. 20 (2013), no. 2, 54-60.
10 I. Fabrici and T. Madaras, The structure of 1-planar graphs, Discrete Math. 307 (2007), no. 7-8, 854-865.   DOI
11 S. Jendrol and H.-J. Voss, Light subgraphs of graphs embedded in the plane-A survey, Discrete Math. 313 (2013), no. 4, 406-421.   DOI
12 B. Grunbaum, New views on some old questions of combinatorial geometry, IColloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo I, pp. 451-468. Atti dei Convegni Lincei, No. 17, Accad. Naz. Lincei, Rome, 1976.
13 D. Hudak and P. Sugerek, Light edges in 1-planar graphs with prescribed minimum degree, Discuss. Math. Graph Theory 32 (2012), no. 3, 545-556.   DOI