The largest real zero of the chromatic polynomial

DOI10.1016/S0012-365X(96)00277-4zbMath0888.05029OpenAlexW2072572225MaRDI QIDQ1366787

Douglas R. Woodall

Publication date: 1 June 1998

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00277-4

zbMATH Keywords

chromatic polynomialplanar graphlargest real zone

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

On zeros of the characteristic polynomial of matroids of bounded tree-width ⋮ 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 ⋮ Chromatic properties of Hamiltonian graphs ⋮ Inapproximability of the Tutte polynomial of a planar graph ⋮ Approximating the chromatic polynomial is as hard as computing it exactly ⋮ Is the five-flow conjecture almost false? ⋮ Zero-free intervals of chromatic polynomials of hypergraphs ⋮ Transfer matrices and partition-function zeros for antiferromagnetic Potts models. IV. Chromatic polynomial with cyclic boundary conditions

Cites Work

• Unnamed Item
• Unnamed Item
• A zero-free interval for chromatic polynomials
• Is the four-color conjecture almost false?
• Chromatic polynomials, polygon trees, and outerplanar graphs
• The Zero-Free Intervals for Chromatic Polynomials of Graphs
• Chromatic Polynomials

This page was built for publication: The largest real zero of the chromatic polynomial