Exponentially many 5-list-colorings of planar graphs

被引:19
作者
Thomassen, Carsten [1 ]
机构
[1] Tech Univ Denmark, Dept Math, DK-2800 Lyngby, Denmark
关键词
list colorings;
D O I
10.1016/j.jctb.2006.09.002
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We prove that every planar graph with n vertices has at least 2(n/9) distinct list-colorings provided every vertex has at least five available colors. (C) 2006 Elsevier Inc. All rights reserved.
引用
收藏
页码:571 / 583
页数:13
相关论文
共 7 条
[1]  
[Anonymous], GRAPHS SURFACES
[2]   CHROMATIC POLYNOMIALS [J].
BIRKHOFF, GD ;
LEWIS, DC .
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1946, 60 (NOV) :355-451
[3]   EVERY PLANAR GRAPH IS 5-CHOOSABLE [J].
THOMASSEN, C .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 62 (01) :180-181
[4]   Color-critical graphs on a fixed surface [J].
Thomassen, C .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1997, 70 (01) :67-100
[5]  
THOMASSEN C, IN PRESS DISCRETE MA
[6]   Many 3-colorings of triangle-free planar graphs [J].
Thomassen, Carsten .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (03) :334-349
[7]   LIST COLORINGS OF PLANAR GRAPHS [J].
VOIGT, M .
DISCRETE MATHEMATICS, 1993, 120 (1-3) :215-219