✦ LIBER ✦

Oriented 5-coloring of sparse plane graphs

✍ Scribed by O. V. Borodin; A. O. Ivanova; A. V. Kostochka

Book ID: 111471095
Publisher: Pleiades Publishing
Year: 2007
Tongue: English
Weight: 506 KB
Volume: 1
Category: Article
ISSN: 1990-4789
DOI: 10.1134/s1990478907010024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

-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

✍ 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

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