List edge and list total colorings of planar graphs without short cycles

作者：Liu Bin; Hou Jianfeng; Liu Guizhen^*

来源：Information Processing Letters, 2008, 108(6): 347-351.

DOI：10.1016/j.ipl.2008.07.003

• Combinatorial problems
• List coloring
• Planar graph
• Choosability

Let G be a planar graph with maximum degree Delta(G). We use chi(l)'(G) and chi(l)''(G) to denote the list edge chromatic number and list total chromatic number of G. respectively. In this paper, it is proved that chi(l)'(G) = Delta(G) and chi(l)''(G) = Delta(G)+ 1 if Delta(G) >= 6 and G has neither C-4 nor C-6. or Delta(G) >= 7 and G has neither C-5 nor C-6, where C-k is a cycle of length k.

• 出版日期2008-11-30
• 单位山东大学