论文信息 - The chromatic polynomial and list colorings - 字舞流文

The chromatic polynomial and list colorings

We prove that, if a graph has a list of k available colors at every vertex, then the number of list-colorings is at least the chromatic polynomial evaluated at k when k is sufficiently large compared to the number of vertices of the graph.

Carsten Thomassen | C. Thomassen

[1] Carsten Thomassen. Exponentially many 5-list-colorings of planar graphs , 2007, J. Comb. Theory, Ser. B.

[2] Carsten Thomassen. Many 3-colorings of triangle-free planar graphs , 2007, J. Comb. Theory, Ser. B.

[3] Margit Voigt,et al. A not 3-choosable planar graph without 3-cycles , 1995, Discret. Math..

[4] Carsten Thomassen,et al. Every Planar Graph Is 5-Choosable , 1994, J. Comb. Theory B.

[5] Margit Voigt,et al. List colourings of planar graphs , 2006, Discret. Math..

[6] Noga Alon,et al. Colorings and orientations of graphs , 1992, Comb..

[7] Martin Aigner,et al. Proofs from THE BOOK , 1998 .

[8] Margit Voigt. List colourings of planar graphs , 2006, Discret. Math..

[9] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .

[10] N. Alon. Restricted colorings of graphs , 1993 .

[11] G. Birkhoff. A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .

[12] Fred Galvin,et al. The List Chromatic Index of a Bipartite Multigraph , 1995, J. Comb. Theory B.