✦ LIBER ✦

On the clique-transversal number of chordal graphs

✍ Scribed by Thomas Andreae

Book ID: 108316257
Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 433 KB
Volume: 191
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(98)00087-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Bounds on the clique-transversal number

Bounds on the clique-transversal number of regular graphs

✍ ErFang Shan; T. C. E. Cheng; LiYing Kang 📂 Article 📅 2008 🏛 SP Science China Press 🌐 English ⚖ 455 KB

Reduced clique graphs of chordal graphs

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

Clique transversal and clique independen

Clique transversal and clique independence on comparability graphs

✍ V. Balachandran; P. Nagavamsi; C.Pandu Rangan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Clique Graphs of Chordal and Path Graphs

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

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