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

被引：2
|
作者：
Lu, Zai Ping [1 ]
Song, Ning [1 ]
机构：
[1] Nankai Univ, Ctr Combinator, LPMC TJKLC, Tianjin 300071, Peoples R China
来源：
BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY | 2017年 / 54卷 / 03期
关键词：
1-planar graph; weight; light edge; EDGE COLORINGS;
D O I：
10.4134/BKMS.b160296
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph is called 1-planar if it can be drawn in the Euclidean plane 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 >= 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.
引用
收藏
页码：763 / 787
页数：25
相关论文
共 25 条
123