Bull. Korean Math. Soc. 2012; 49(2): 359-365
Printed March 1, 2012
https://doi.org/10.4134/BKMS.2012.49.2.359
Copyright © The Korean Mathematical Society.
Aijun Dong, Guizhen Liu, and Guojun Li
Shandong University, Shandong University, Shandong University
Giving a planar graph $G$, let $\chi'_l(G)$ and $\chi''_l(G)$ denote the list edge chromatic number and list total chromatic number of $G$ respectively. It is proved that if a planar graph $G$ without 6-cycles with chord, then $\chi'_l(G)\leq\Delta(G)+1$ and $\chi''_l(G)\leq\Delta(G)+2$ where $\Delta(G)\geq6$.
Keywords: list coloring, planar graph, choosability
MSC numbers: 05C15
2022; 59(1): 27-43
2018; 55(2): 415-430
2017; 54(1): 331-342
2016; 53(1): 139-151
© 2022. The Korean Mathematical Society. Powered by INFOrang Co., Ltd