𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Turanlike Neighborhood Condition and Cliques in Graphs

✍ Scribed by NOGA ALON; RALPH FAUDREE; ZOLTAN FÜREDI

Book ID
119862989
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
233 KB
Volume
555
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique neighborhoods and nearly chordal
Clique neighborhoods and nearly chordal graphs
✍ Terry A. McKee 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 559 KB

We study two new special families of complete subgraphs of a graph. For chordal graphs, one of these reduces to the family of minimal vertex separators while the other is empty. When the intersection characterization of chordal graphs is extended from acyclic (i.e., K3-free chordal) hosts to K4-free

Cliques and extended triangles. A necess
Cliques and extended triangles. A necessary condition for planar clique graphs
✍ Liliana Alcón; Marisa Gutierrez 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 256 KB

By generalizing the idea of extended triangle of a graph, we succeed in obtaining a common framework for the result of Roberts and Spencer about clique graphs and the one of Szwarcÿter about Helly graphs. We characterize Helly and 3-Helly planar graphs using extended triangles. We prove that if a pl

Strong clique trees, neighborhood trees,
Strong clique trees, neighborhood trees, and strongly chordal graphs
✍ McKee, Terry A. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB 👁 1 views

Maximal complete subgraphs and clique trees are basic to both the theory and applications of chordal graphs. A simple notion of strong clique tree extends this structure to strongly chordal graphs. Replacing maximal complete subgraphs with open or closed vertex neighborhoods discloses new relationsh