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].

• Type: Journal
• Year: 2008
• Where: DM
• Authors: Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni
• Keywords: DM 2008, K-improper Chromatic Number, Random Unit Disk, Unit Disk Graphs