Clique colouring of binomial random graphs
A clique colouring of a graph is a colouring of the vertices so that no maximal clique is monochromatic (ignoring isolated vertices). The smallest number of colours in such a colouring is the clique chromatic number. In this paper, we study the asymptotic behaviour of the clique chromatic number o...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
John Wiley and Sons, Inc.
2018
|