The mean chromatic number of paths and c
β
Martin Anthony; Norman Biggs
π
Article
π
1993
π
Elsevier Science
π
English
β 245 KB
The mean chromatic number of a graph is defined. This is a measure of the expected performance of the greedy vertex-colouring algorithm when each ordering of the vertices is equally likely. In this note, we analyse the asymptotic behaviour of the mean chromatic number for the paths and even cycles,