✦ LIBER ✦

-coloring of sparse graphs

✍ Scribed by O.V. Borodin; A.O. Ivanova; M. Montassier; A. Raspaud

Book ID: 113567529
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 262 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.11.031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ O.V. Borodin; A.O. Ivanova; M. Montassier; A. Raspaud 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 238 KB

Linear coloring of sparse graphs

✍ Yingqian Wang; Qian Wu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 324 KB

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.

Equitable Coloring of Sparse Planar Grap

Equitable Coloring of Sparse Planar Graphs

✍ Luo, Rong; Sereni, Jean-Sébastien; Stephens, D. Christopher; Yu, Gexin 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 219 KB

Acyclic edge coloring of sparse graphs

✍ Yingqian Wang; Ping Sheng 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 285 KB