Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

DM
2008

favoriteEmaildiscussreport

103views more DM 2008»

Improper colouring of (random) unit disk graphs

13 years 4 months ago

Improper colouring of (random) unit disk graphs

Download kam.mff.cuni.cz

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

Real-time Traffic

DM 2008 | K-improper Chromatic Number | Random Unit Disk | Unit Disk Graphs |

claim paper

Related Content

» Local Edge Colouring of YaoLike Subgraphs of Unit Disk Graphs

» On random points in the unit disk

» The Expected Size of the Rule k Dominating Set

» Radio Network Clustering from Scratch

» Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs

» Distance graphs from random geometric graphs to Bernoulli graphs and between

» On a Family of Strong Geometric Spanners That Admit Local Routing Strategies

» Fast Deterministic Distributed Maximal Independent Set Computation on GrowthBounded Graphs

» ParallelExternal Computation of the Cycle Structure of Invertible Cryptographic Functions

Post Info
More Details (n/a)

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)