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

Combinatorics Probability and Computing

Volumn 7, Issue 2, 1998, Pages 211-216

  Mosca, Michele ^a  

^a WOLFSON COLLEGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032371804     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548397003222     Document Type: Article

References (3)

1. Bartels, J. Eric, and Welsh, Dominic J. A. (1995) The Markov Chain of colourings. In Integer Programming and Combinatorial Optimization: 4th International IPCO Conference (Egon Balas and Jens Clausen, eds), Vol. 920 of Lecture Notes in Computer Science, Springer, pp. 373-387.
2. Biggs, Norman (1974) Algebraic Graph Theory. Cambridge University Press, Cambridge.
3. Seymour, P. (1996) Two Chromatic Polynomial Conjectures. Preprint.