New bounds for chromatic polynomials and chromatic roots

DOI10.1016/j.disc.2015.04.021zbMath1314.05061arXiv1611.09545OpenAlexW1001014873MaRDI QIDQ2352058

Aysel Erey, Jason I. Brown

Publication date: 29 June 2015

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

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

zbMATH Keywords

chromatic numberchromatic polynomialchromatic root\(k\)-colouring

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Related Items (8)

Upper bounds on the chromatic polynomial of a connected graph with fixed clique number ⋮ A proof of Tomescu's graph coloring conjecture ⋮ Maximizing the number of \(x\)-colorings of 4-chromatic graphs ⋮ Extremal colorings and independent sets ⋮ Descent polynomials ⋮ Maximum number of colourings: 5-chromatic case ⋮ Maximum number of colourings: 4-chromatic graphs ⋮ Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum chromatic polynomial of 3-chromatic blocks
• Le nombre maximal de 3-colorations d'un graphe connexe. (The maximal number of 3-colorations of a connected graph)
• Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
• Maximal chromatic polynomials of connected planar graphs
• Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree

This page was built for publication: New bounds for chromatic polynomials and chromatic roots