Plane graphs with maximum degree 9 are entirely 11-choosable
暂无分享,去创建一个
[1] Xuding Zhu,et al. Entire colouring of plane graphs , 2011, J. Comb. Theory, Ser. B.
[2] John Mitchem,et al. The entire chromatic number of a normal graph is at most seven , 1972 .
[3] Yue Zhao,et al. On the Entire Coloring Conjecture , 2000, Canadian Mathematical Bulletin.
[4] Oleg V. Borodin,et al. Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces , 1993 .
[5] Yingqian Wang,et al. Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable , 2013, J. Graph Theory.
[6] Wei Dong. A note on entire choosability of plane graphs , 2012, Discret. Appl. Math..
[7] Timothy J. Hetherington. Entire choosability of near-outerplane graphs , 2009, Discret. Math..
[8] Yiqiao Wang,et al. Plane graphs are entirely (δ + 5)-Choosable , 2014, Discret. Math. Algorithms Appl..
[9] Wei-Fan Wang,et al. The entire choosability of plane graphs , 2016, J. Comb. Optim..
[10] John Mitchem,et al. A seven-color theorem on the sphere , 1973, Discret. Math..
[11] Wei-Fan Wang. On the colorings of outerplanar graphs , 1995, Discret. Math..
[12] Zhang Zhong. The Complete Chromatic Number of Some Planar Graphs , 1993 .
[13] Wei-Fan Wang,et al. Planar Graphs with $\Delta\ge 9$ are Entirely (Δ+2)-Colorable , 2014, SIAM J. Discret. Math..
[14] Oleg V. Borodin. Structural theorem on plane graphs with application to the entire coloring number , 1996 .
[15] Wang Weifan,et al. Upper Bounds of Entire Chromatic Number of Plane Graphs , 1999 .