Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph

DOI10.1017/S0963548397003222zbMath0908.05044OpenAlexW2127009234MaRDI QIDQ4212881

Michele Mosca

Publication date: 18 March 1999

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548397003222

zbMATH Keywords

colouringsaverage number of colours

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Bounds for mean colour numbers of graphs ⋮ Mean color numbers of some graphs

This page was built for publication: Removing Edges Can Increase the Average Number of Colours in the Colourings of a Graph