Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

96

Voted

JCT
2007

77views more JCT 2007»

Exponentially many 5-list-colorings of planar graphs

15 years 2 months ago

Exponentially many 5-list-colorings of planar graphs

Download www.math.u-szeged.hu

We prove that every planar graph with n vertices has at least 2n/9 distinct list-colorings provided every vertex has at least ﬁve available colors. © 2006 Elsevier Inc. All rights reserved.

Carsten Thomassen

Real-time Traffic

Available Colors | Distinct List-colorings | JCT 2007 | Planar Graph |

claim paper

Related Content

» A polynomial time algorithm for determining zero EulerPetrie genus of an Eulerian graph

Post Info
More Details (n/a)

Added	15 Dec 2010
Updated	15 Dec 2010
Type	Journal
Year	2007
Where	JCT
Authors	Carsten Thomassen

Comments (0)