Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings

DOI10.1016/j.jctb.2022.05.003zbMath1490.05072arXiv2108.12669OpenAlexW3197582057MaRDI QIDQ2673487

Luke Postle, Zdeněk Dvořák

Publication date: 10 June 2022

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

Full work available at URL: https://arxiv.org/abs/2108.12669

zbMATH Keywords

triangle-freenumber of colorings

Mathematics Subject Classification ID

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

Cites Work

• Planar 4-critical graphs with four triangles
• Many 3-colorings of triangle-free planar graphs
• Chromatic Polynomials