The largest non-integer real zero of chromatic polynomials of graphs with fixed order

DOI10.1016/j.disc.2003.11.006zbMath1042.05037OpenAlexW2006836809MaRDI QIDQ1827734

Yanyan Li

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.disc.2003.11.006

zbMATH Keywords

GraphChromatic polynomialZero

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

ZDP(n) ${Z}_{DP}(n)$ is bounded above by n2−(n+3)∕2 ${n}^{2}-(n+3)\unicode{x02215}2$ ⋮ A note on the real part of complex chromatic roots ⋮ A little statistical mechanics for the graph theorist ⋮ On upper bounds for real roots of chromatic polynomials

Cites Work

• A Zero-Free Interval for Chromatic Polynomials of Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The largest non-integer real zero of chromatic polynomials of graphs with fixed order