✦ LIBER ✦

Improper coloring of unit disk graphs

✍ Scribed by Frédéric Havet; Ross J. Kang; Jean-Sébastien Sereni

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 240 KB
Volume: 54
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20318

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Motivated by a satellite communications problem, we consider a generalized coloring problem on unit disk graphs. A coloring is k‐improper if no more than k neighbors of every vertex have the same colour as that assigned to the vertex. The k‐improper chromatic number χ^k^(G) is the least number of colors needed in a k‐improper coloring of a graph G. The main subject of this work is analyzing the complexity of computing χ^k^ for the class of unit disk graphs and some related classes, e.g., hexagonal graphs and interval graphs. We show NP‐completeness in many restricted cases and also provide both positive and negative approximability results. Because of the challenging nature of this topic, many seemingly simple questions remain: for example, it remains open to determine the complexity of computing χ^k^ for unit interval graphs. © 2009 Wiley Periodicals, Inc. NETWORKS, 2009

📜 SIMILAR VOLUMES

On Coloring Unit Disk Graphs

✍ A. Gräf; M. Stumpf; G. Weißenfels 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 237 KB

Acrylic improper colorings of graphs

✍ Boiron, P.; Sopena, E.; Vignal, L. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB 👁 2 views

In this article, we introduce the new notion of acyclic improper colorings of graphs. An improper coloring of a graph is a vertex-coloring in which adjacent vertices are allowed to have the same color, but each color class V i satisfies some condition depending on i. Such a coloring is acyclic if th

Unit disk graphs

✍ Brent N. Clark; Charles J. Colbourn; David S. Johnson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 878 KB

A note on list improper coloring planar

A note on list improper coloring planar graphs

✍ Ko-Wei Lih; Zengmin Song; Weifan Wang; Kemin Zhang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A graph G is called (k, d)\*-choosable if, for every list assignment L satisfying [L(v)l = k for all v E V(G), there is an L-coloring of G such that each vertex of G has at most d neighbors colored with the same color as itself. In this note, we prove that every planar graph without 4-cycles and /-c

Bisectored unit disk graphs

✍ John Nolan 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract Unit disk graphs form a natural model for cellular radio channel assignment problems under the assumption of equally powerful, omnidirectional transmitters located on a uniform, flat plane. Here, we introduce and give motivation for an extension of this model, namely, sectorization at t

Simple heuristics for unit disk graphs

✍ M. V. Marathe; H. Breu; H. B. Hunt III; S. S. Ravi; D. J. Rosenkrantz 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 990 KB