Optimal graphs for chromatic polynomials

DOI10.1016/j.disc.2007.04.069zbMath1138.05028OpenAlexW1987229802MaRDI QIDQ2483402

Italo Simonelli

Publication date: 28 April 2008

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

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

zbMATH Keywords

upper and lower boundsbipartite graphschromatic polynomials

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Optimal domination polynomials ⋮ Optimal graphs for independence and \(k\)-independence polynomials ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Maximum number of colourings: 4-chromatic graphs

Cites Work

• Unnamed Item
• Legal coloring of graphs
• Coefficients of chromatic polynomials
• Some corollaries of a theorem of Whitney on the chromatic polynomial
• On the greatest number of 2 and 3 colorings of a (v, e)-graph
• Graphs with least number of colorings

This page was built for publication: Optimal graphs for chromatic polynomials