The entire choosability of plane graphs

被引：1

作者：

Wang, Weifan ^{[1
]}

Wu, Tingting ^{[1
]}

Hu, Xiaoxue ^{[1
]}

Wang, Yiqiao ^{[2
]}

机构：

[1] Zhejiang Normal Univ, Dept Math, Jinhua 321004, Peoples R China

[2] Beijing Univ Chinese Med, Sch Management, Beijing 100029, Peoples R China

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2016年 / 31卷 / 03期

关键词：

Plane graph; Entire choosability; Maximum degree; ENTIRE CHROMATIC NUMBER; COLORINGS; THEOREM;

D O I：

10.1007/s10878-014-9819-9

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

A plane graph is entirely -choosable if, for every list of colors satisfying for all , there exists a coloring which assigns to each vertex, each edge and each face a color from its list so that any adjacent or incident elements receive different colors. In 1993, Borodin proved that every plane graph with maximum degree is entirely -choosable. In this paper, we improve this result by replacing 12 by 10.

引用

页码：1221 / 1240

页数：20

共 21 条

[1] Colorings of plane graphs: A survey [J].

Borodin, O. V. .

DISCRETE MATHEMATICS, 2013, 313 (04) :517-539

[2]

Borodin O.V., 1993, METEM ZAMETKI, V53, P35

[3]

Borodin O.V., 1987, METODY DISKRET ANALI, V45, P21

[4]

Borodin OV, 1996, J GRAPH THEOR, V23, P233, DOI 10.1002/(SICI)1097-0118(199611)23:3<233::AID-JGT3>3.0.CO

[5]

2-T

[6] SIMULTANEOUS COLORING OF EDGES AND FACES OF PLANE GRAPHS [J].

BORODIN, OV .

DISCRETE MATHEMATICS, 1994, 128 (1-3) :21-33

[7] A NEW PROOF OF THE 6 COLOR THEOREM [J].

BORODIN, OV .

JOURNAL OF GRAPH THEORY, 1995, 19 (04) :507-521

[8] A note on entire choosability of plane graphs [J].

Dong, Wei .

DISCRETE APPLIED MATHEMATICS, 2012, 160 (7-8) :1257-1261

[9] Entire choosability of near-outerplane graphs [J].

Hetherington, Timothy J. .

DISCRETE MATHEMATICS, 2009, 309 (08) :2153-2165

[10] PLANE GRAPHS ARE ENTIRELY (Delta+ 5)-CHOOSABLE [J].

Hu, Xiaoxue ;

Wang, Yiqiao .

DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (02)

← 1 2 3 →