Proof of a chromatic polynomial conjecture

DOI10.1006/jctb.1999.1925zbMath1025.05025OpenAlexW2151045861MaRDI QIDQ1569069

N. Delaunay

Publication date: 25 June 2000

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1925

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Chromatic polynomials of simplicial complexes ⋮ A note on the shameful conjecture ⋮ Bounds for mean colour numbers of graphs ⋮ Problems on chromatic polynomials of hypergraphs ⋮ Mean color numbers of some graphs

Cites Work

• Unnamed Item
• Two chromatic polynomial conjectures
• The Markov chain of colourings
• An introduction to chromatic polynomials

This page was built for publication: Proof of a chromatic polynomial conjecture