Discrete Mathematics & Theoretical Computer Science, Vol 15, No 1 (2013)

Font Size:  Small  Medium  Large

List Edge and List Total Colorings of Planar Graphs without non-induced 7-cycles

Aijun Dong, Guizhen Liu, Guojun Li


Giving a planar graph G, let χ'l(G) and χ''l(G) denote the list edge chromatic number and list total chromatic number of G respectively. It is proved that if G is a planar graph without non-induced 7-cycles, then χ'l(G)≤Δ(G)+1 and χ''l(G)≤Δ(G)+2 where Δ(G)≥7.

Full Text: PDF PostScript