The number of \(k\)-colorings of a graph on a fixed surface

DOI10.1016/j.disc.2005.04.027zbMath1200.05090OpenAlexW2047109885WikidataQ56926684 ScholiaQ56926684MaRDI QIDQ856865

Carsten Thomassen

Publication date: 14 December 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.04.027

zbMATH Keywords

chromatic polynomialgraphs on surfaces

Mathematics Subject Classification ID

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

Related Items

Hyperbolic families and coloring graphs on surfaces ⋮ The number of colorings of planar graphs with no separating triangles ⋮ Many 3-colorings of triangle-free planar graphs ⋮ Exponentially many 5-list-colorings of planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Five-coloring graphs on the torus
• Every planar graph is 5-choosable
• Color-critical graphs on a fixed surface
• Chromatic Polynomials

This page was built for publication: The number of \(k\)-colorings of a graph on a fixed surface