✦ LIBER ✦

Packingr-Cliques in Weighted Chordal Graphs

✍ Scribed by P. Hell; S. Klein; L. T. Nogueira; F. Protti

Book ID: 106344181
Publisher: Springer US
Year: 2005
Tongue: English
Weight: 160 KB
Volume: 138
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-005-2452-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dominating cliques in chordal graphs

✍ Dieter Kratsch; Peter Damaschke; Anna Lubiw 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 492 KB

A chordal graph has a dominating clique iff it has diameter at most 3. A strongly chordal graph which has a dominating clique has one as small as the smallest dominating set-and, furthermore, there is a linear-time algorithm to find such a small dominating clique.

Reduced clique graphs of chordal graphs

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

Squares, clique graphs, and chordality

✍ W. D. Wallis; Julin Wu 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB

## Abstract We study the squares and the clique graphs of chordal graphs and various special classes of chordal graphs. Chordality conditions for squares and clique graphs are given. Several theorems concering chordal graphs are generalized. © 1996 John Wiley & Sons, Inc.

Clique Graphs of Chordal and Path Graphs

✍ Szwarcfiter, Jayme L.; Bornstein, Claudson F. 📂 Article 📅 1994 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 739 KB

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

Diameters of iterated clique graphs of c

Diameters of iterated clique graphs of chordal graphs

✍ Bor-Liang Chen; Ko-Wei Lih 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 272 KB

## Abstract The clique graph __K__(__G__) of a graph is the intersection graph of maximal cliques of __G.__ The iterated clique graph __K__^__n__^(__G__) is inductively defined as __K__(K^n−1^(__G__)) and __K__^1^(__G__) = __K__(__G__). Let the diameter diam(__G__) be the greatest distance between