𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Clique or hole in claw-free graphs

✍ Scribed by Henning Bruhn; Akira Saito


Book ID
113698879
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
232 KB
Volume
102
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Complexity of clique-coloring odd-hole-f
✍ 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