Improper colouring of (random) unit disk graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2005

Improper colouring of (random) unit disk graphs


For any graph $G$, the $k$-improper chromatic number $\chi^k(G)$ is the smallest number of colours used in a colouring of $G$ such that each colour class induces a subgraph of maximum degree $k$. We investigate the ratio of the $k$-improper chromatic number to the clique number for unit disk graphs and random unit disk graphs to generalise results where only proper colouring was considered.
Fichier principal
Vignette du fichier
RR-5761.pdf (217.93 Ko) Télécharger le fichier

Dates and versions

inria-00070259 , version 1 (19-05-2006)


  • HAL Id : inria-00070259 , version 1


Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni. Improper colouring of (random) unit disk graphs. [Research Report] RR-5761, INRIA. 2005, pp.18. ⟨inria-00070259⟩
121 View
179 Download


Gmail Facebook Twitter LinkedIn More