| HAL-Inria | Publications, software ... of Inria's scientists |
Reports
Improper colouring of (random) unit disk graphs
Abstract : 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.
https://hal.inria.fr/inria-00070259
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 7:45:53 PM
Last modification on : Tuesday, May 26, 2020 - 6:50:22 PM
Long-term archiving on: : Sunday, April 4, 2010 - 8:46:08 PM
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 7:45:53 PM
Last modification on : Tuesday, May 26, 2020 - 6:50:22 PM
Long-term archiving on: : Sunday, April 4, 2010 - 8:46:08 PM