✦ LIBER ✦

Three complexity results on coloring -free graphs

✍ Scribed by Hajo Broersma; Fedor V. Fomin; Petr A. Golovach; Daniël Paulusma

Book ID: 119233246
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 327 KB
Volume: 34
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.12.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of clique-coloring odd-hole-f

Complexity of clique-coloring odd-hole-free graphs

✍ David Défossez 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract In this paper we investigate the problem of clique‐coloring, which consists in coloring the vertices of a graph in such a way that no monochromatic maximal clique appears, and we focus on odd‐hole‐free graphs. On the one hand we do not know any odd‐hole‐free graph that is not 3‐clique‐c

Closing complexity gaps for coloring pro

Closing complexity gaps for coloring problems on H-free graphs

✍ Golovach, Petr A.; Paulusma, Daniël; Song, Jian 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 632 KB

Coloring vertices of claw-free graphs in

Coloring vertices of claw-free graphs in three colors

✍ Vadim Lozin, Christopher Purcell 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 379 KB

On -hued coloring of -minor free graphs

✍ Song, Huimin; Fan, Suohai; Chen, Ye; Sun, Lei; Lai, Hong-Jian 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 403 KB

Effective on-line coloring ofP5-free gra

Effective on-line coloring ofP5-free graphs

✍ András Gyárfás; Jenő Lehel 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 235 KB

A Class of Three-Colorable Triangle-Free

A Class of Three-Colorable Triangle-Free Graphs

✍ Marko Radovanović; Kristina Vušković 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 543 KB