Exponentially many 5-list-colorings of planar graphs

• Autores: Carsten Thomassen
• Localización: Journal of combinatorial theory. Series B, ISSN 0095-8956, Vol. 97, Nº. 4, 2007, págs. 571-583
• Idioma: inglés
• DOI: 10.1016/j.jctb.2006.09.002
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.