✦ LIBER ✦

On Coloring Unit Disk Graphs

✍ Scribed by A. Gräf; M. Stumpf; G. Weißenfels

Publisher: Springer
Year: 1998
Tongue: English
Weight: 237 KB
Volume: 20
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009196

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improper coloring of unit disk graphs

✍ Frédéric Havet; Ross J. Kang; Jean-Sébastien Sereni 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB

## 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__^

Unit disk graphs

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

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

On list-coloring outerplanar graphs

✍ Joan P. Hutchinson 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

## Abstract We prove that a 2‐connected, outerplanar bipartite graph (respectively, outerplanar near‐triangulation) with a list of colors __L__ (__v__ ) for each vertex __v__ such that $|L(v)|\geq\min\{{\deg}(v),4\}$ (resp., $|L(v)|\geq{\min}\{{\deg}(v),5\}$) can be __L__‐list‐colored (except when

On thefg-coloring of graphs

✍ S. Nakano; T. Nishizeki; N. Saito 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 739 KB