Planar triangulations with real chromatic roots arbitrarily close to 4
From MaRDI portal
Publication:941623
DOI10.1007/s00026-008-0347-0zbMath1160.05023arXivmath/0511304OpenAlexW2167430454MaRDI QIDQ941623
Publication date: 2 September 2008
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0511304
chromatic polynomialchromatic rootplanar triangulationBirkhoff-Lewis conjecturecylindrical triangular lattice
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items (8)
A tree-decomposed transfer matrix for computing exact Potts model partition functions for arbitrary graphs, with applications to planar graph colourings ⋮ Density of Chromatic Roots in Minor-Closed Graph Families ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial ⋮ The number of colorings of planar graphs with no separating triangles ⋮ Unnamed Item ⋮ Chromatic bounds on orbital chromatic roots ⋮ Is the five-flow conjecture almost false? ⋮ A little statistical mechanics for the graph theorist
Uses Software
This page was built for publication: Planar triangulations with real chromatic roots arbitrarily close to 4
