✦ LIBER ✦

Clique covers and coloring problems of graphs

✍ Scribed by Walter Klotz

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 419 KB
Volume: 46
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(89)90053-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On clique covers and independence number

On clique covers and independence numbers of graphs

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 485 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

Covering all cliques of a graph

✍ Zsolt Tuza 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 701 KB

The following conjecture of T. Gallai is proved: If G is a chordal graph on n vertices, such that all its maximal complete subgraphs have order at least 3, then there is a vertex set of cardinality ~n/3 which meets all maximal complete subgraphs of G. Further related results are given.

On antichain intersection numbers, total

On antichain intersection numbers, total clique covers and regular graphs

✍ Morimasa Tsuchiya 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 742 KB

In this paper, we consider total clique covers and intersection numbers on multifamilies. We determine the antichain intersection numbers of graphs in terms of total clique covers. From this result and some properties of intersection graphs on multifamilies, we determine the antichain intersection n

Asymptotic Clique Covering Ratios of Dis

Asymptotic Clique Covering Ratios of Distance Graphs

✍ Daphne D.-F Liu; Xuding Zhu 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 126 KB

Given a finite set D of positive integers, the distance graph G(Z , D) has Z as the vertex set and {i j : |i -j| ∈ D} as the edge set. Given D, the asymptotic clique covering ratio is defined as S(D) = lim sup n→∞ n cl(n) , where cl(n) is the minimum number of cliques covering any consecutive n vert