Bounds for mean colour numbers of graphs

DOI10.1016/S0095-8956(02)00023-0zbMath1027.05041OpenAlexW2135081210MaRDI QIDQ1405125

D. Massart

Publication date: 25 August 2003

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

Full work available at URL: https://doi.org/10.1016/s0095-8956(02)00023-0

zbMATH Keywords

chromatic polynomial

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Mean color numbers of some graphs

Cites Work

• Graph minors. III. Planar tree-width
• Proof of a chromatic polynomial conjecture
• Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph
• The Markov chain of colourings
• Unnamed Item
• Unnamed Item
• Unnamed Item