✦ LIBER ✦

Critical graphs for clique-coloring

✍ Scribed by Meziane Aider; Sylvain Gravier

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 241 KB
Volume: 5
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(05)80110-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique covers and coloring problems of g

Clique covers and coloring problems of graphs

✍ Walter Klotz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 419 KB

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

Clique-coloring some classes of odd-hole

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

✍ David Défossez 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 1 views

On color critical graphs

✍ Vojtech Rödl; Zsolt Tuza 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 555 KB

Color-critical graphs and hypergraphs

✍ B Toft 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 1020 KB

Clique-gated graphs

✍ Johann Hagauer; Sandi Klavẑar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 345 KB

Clique-gated graphs form an extension of quasi-median graphs. Two characterizations of these graphs are given and some other structural properties are obtained. An O(nm) algorithm is presented which recognizes clique-gated graphs. Here n and m denote the numbers of vertices and edges of a given grap