✦ LIBER ✦

Clique-coloring some classes of odd-hole-free graphs

✍ Scribed by David Défossez

Publisher: John Wiley and Sons
Year: 2006
Tongue: English
Weight: 185 KB
Volume: 53
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20177

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

A Characterization of Some Graph Classes

A Characterization of Some Graph Classes with No Long Holes

✍ E. Eschen; R. Sritharan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We give a characterization of a hierarchy of graph classes with no long holes in which each class excludes some long antiholes. At one end of the hierarchy is the class of graphs with no long holes. At the other end is the class of weakly triangulated graphs. The characterization has the flavor of t