Planar triangulations with real chromatic roots arbitrarily close to four

2005/11/11 by Gordon Royle, Royle, Gordon F. · 1 citation
Computer Science · Mathematics · #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #FOS: Mathematics #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.math/0511304

openalex publication_date 2005/11/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We exhibit infinite families of planar graphs with real chromatic roots arbitrarily close to 4, thus resolving a long-standing conjecture in the affirmative.

Citations

• A Determinant Formula for the Number of Ways of Coloring a Map

Cited by

• Errata and Addenda to Mathematical Constants

Related

• Special Partial Graphs
• Deciding 4-colorability of planar triangulations
• Mathematical Proofs of Two Conjectures: The Four Color Problem and The Uniquely 4-colorable Planar Graph
• A Simple Proof of the Four-Color Theorem
• 3-Colouring Planar Graphs