The number of colorings of planar graphs with no separating triangles

DOI10.1016/j.jctb.2016.08.005zbMath1350.05043OpenAlexW2518957473WikidataQ56926474 ScholiaQ56926474MaRDI QIDQ345111

Carsten Thomassen

Publication date: 25 November 2016

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

zbMATH Keywords

chromatic polynomialplanar triangulations

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of \(k\)-colorings of a graph on a fixed surface
• Planar triangulations with real chromatic roots arbitrarily close to 4
• The largest real zero of the chromatic polynomial
• Color-critical graphs on a fixed surface
• COLOURING, PACKING AND THE CRITICAL PROBLEM
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• Chromatic Polynomials

This page was built for publication: The number of colorings of planar graphs with no separating triangles