List coloring;
Planar graph;
Choosability;
TOTAL CHOOSABILITY;
D O I:
暂无
中图分类号:
TP31 [计算机软件];
学科分类号:
081202 ;
0835 ;
摘要:
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 G is a planar graph without non-induced 7-cycles, then chi(l)'(G) <= Delta(G) + 1 and chi('')(l)(G) <= Delta(G) + 2 where Delta(G) >= 7.