Resumen de Exponentially many 5-list-colorings of planar graphs
Carsten Thomassen
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.
Carsten Thomassen
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.
