𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Distance-two coloring of sparse graphs

✍ Scribed by Dvořák, Zdeněk; Esperet, Louis

Book ID
122608932
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
387 KB
Volume
36
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

2-distance coloring of sparse graphs
2-distance coloring of sparse graphs
✍ Marthe Bonamy; Benjamin Lévêque; Alexandre Pinlou 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 189 KB
-coloring of sparse graphs
-coloring of sparse graphs
✍ O.V. Borodin; A.O. Ivanova; M. Montassier; A. Raspaud 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 262 KB
-coloring of sparse graphs
-coloring of sparse graphs
✍ O.V. Borodin; A.O. Ivanova; M. Montassier; A. Raspaud 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 238 KB
Star coloring of sparse graphs
Star coloring of sparse graphs
✍ Yuehua Bu; Daniel W. Cranston; Mickaël Montassier; André Raspaud; Weifan Wang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 174 KB

## Abstract A proper coloring of the vertices of a graph is called a __star coloring__ if the union of every two color classes induces a star forest. The star chromatic number χ~__s__~(__G__) is the smallest number of colors required to obtain a star coloring of __G__. In this paper, we study the r

Coloring Graphs with Sparse Neighborhood
Coloring Graphs with Sparse Neighborhoods
✍ Noga Alon; Michael Krivelevich; Benny Sudakov 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 118 KB

It is shown that the chromatic number of any graph with maximum degree d in which the number of edges in the induced subgraph on the set of all neighbors of any vertex does not exceed d 2 Âf is at most O(dÂlog f ). This is tight (up to a constant factor) for all admissible values of d and f.