A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Clique colourings of geometric graphs
[article]
2018
arXiv
pre-print
A clique colouring of a graph is a colouring of the vertices such that no maximal clique is monochromatic (ignoring isolated vertices). The least number of colours in such a colouring is the clique chromatic number. Given n points x_1, ...,x_n in the plane, and a threshold r>0, the corresponding geometric graph has vertex set {v_1,...,v_n}, and distinct v_i and v_j are adjacent when the Euclidean distance between x_i and x_j is at most r. We investigate the clique chromatic number of such
arXiv:1701.02693v2
fatcat:ajbg2da26vhs7lw2tgh2nm5ym4