✦ LIBER ✦

A class of clique-closed graphs

✍ Scribed by Chai-Ling Deng; Chong-Keang Lim

Book ID: 103058975
Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 406 KB
Volume: 127
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)00472-4

No coin nor oath required. For personal study only.

✦ Synopsis

Let K(G) denote the clique graph of a graph G. If q is a class of graphs, then define K(W) to be {K(G): G&}. The class QF is called a clique-closed class if V= K(%'). A graph G is said to have the D,-property if G has both the Helly and'the T,-properties.

In this paper, we show that the class of D,-graphs is clique-closed.

📜 SIMILAR VOLUMES

New Graph Classes of Bounded Clique-Widt

New Graph Classes of Bounded Clique-Width

✍ Andreas Brandstädt; Feodor F. Dragan; Hoàng-Oanh Le; Raffaele Mosca 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 477 KB

Minimal Classes of Graphs of Unbounded C

Minimal Classes of Graphs of Unbounded Clique-Width

✍ Vadim V. Lozin 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 296 KB

Clique graphs of packed graphs

✍ Iwao Sato 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Let IGI be the number of vertices of a graph G and to(G) be the density of G. We call a graph G packed if the clique graph K(G) of G has exactly 2 IGI-O'(G) cliques. We correct the characterization of clique graphs of packed graphs given in Theorem 3.2 of Hedman [3]. All graphs considered here are f

Clique graphs of time graphs

✍ Bruce Hedman 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Edge-clique graphs

✍ Gary Chartrand; S. F. Kapoor; Terry A. McKee; Farrokh Saba 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 681 KB

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