✦ LIBER ✦

A characterization of clique graphs

✍ Scribed by Fred S. Roberts; Joel H. Spencer

Book ID: 118382491
Publisher: Elsevier Science
Year: 1971
Tongue: English
Weight: 289 KB
Volume: 10
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(71)90070-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique graphs of time graphs

✍ Bruce Hedman 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 517 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

Metric characterizations of proper inter

Metric characterizations of proper interval graphs and tree-clique graphs

✍ Gutierrez, M.; Oubi�a, L. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 393 KB 👁 2 views

A connected graph G is a tree-clique graph if there exists a spanning tree T (a compatible tree) such that every clique of G is a subtree of T. When Tis a path the connected graph G is a proper interval graph which is usually defined as intersection graph of a family of closed intervals of the real

Edge-clique graphs

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

Clique-transversal number of graphs whos

Clique-transversal number of graphs whose clique-graphs are trees

✍ Zuo-song Liang; Er-fang Shan 📂 Article 📅 2008 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 127 KB

Reduced clique graphs of chordal graphs

✍ Michel Habib; Juraj Stacho 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 644 KB