Exponentially many 5-list-colorings of planar graphs

DOI10.1016/j.jctb.2006.09.002zbMath1123.05043OpenAlexW2004922196WikidataQ56926648 ScholiaQ56926648MaRDI QIDQ885292

Carsten Thomassen

Publication date: 8 June 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.09.002

zbMATH Keywords

triangulationplanar graphlist colorings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (max. 100)

Graph polynomials and group coloring of graphs ⋮ The number of defective colorings of graphs on surfaces ⋮ Hyperbolic families and coloring graphs on surfaces ⋮ 5-list-coloring planar graphs with distant precolored vertices ⋮ Many 3-colorings of triangle-free planar graphs ⋮ A General Framework for Hypergraph Coloring ⋮ Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two ⋮ List precoloring extension in planar graphs ⋮ Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs ⋮ What is on his mind? ⋮ Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs ⋮ The chromatic polynomial and list colorings ⋮ Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs ⋮ Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles

Cites Work

• Unnamed Item
• List colourings of planar graphs
• The number of \(k\)-colorings of a graph on a fixed surface
• Many 3-colorings of triangle-free planar graphs
• Every planar graph is 5-choosable
• Color-critical graphs on a fixed surface
• Chromatic Polynomials

This page was built for publication: Exponentially many 5-list-colorings of planar graphs