Sciweavers

Share
DM
2008

Improper colouring of (random) unit disk graphs

10 years 1 months ago
Improper colouring of (random) unit disk graphs
For any graph G, the k-improper chromatic number 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 k for unit disk graphs and random unit disk graphs to generalise results of [24, 22] and [23].
Ross J. Kang, Tobias Müller, Jean-Séba
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where DM
Authors Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni
Comments (0)
books