✦ LIBER ✦

Some characterizations of doubly chordal graphs

✍ Scribed by Lee, Mahnhoon ;Kim, Changhwa

Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 102 KB
Volume: 5
Category: Article
ISSN: 1226-0061
DOI: 10.1007/bf03008936

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Doubly chordal graphs, steiner trees, an

Doubly chordal graphs, steiner trees, and connected domination

✍ M. Moscarini 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 949 KB

A characterization of strongly chordal g

A characterization of strongly chordal graphs

✍ Elias Dahlhaus; Paul D. Manuel; Mirka Miller 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 119 KB

In this paper, we present a simple charactrization of strongly chordal graphs. A chordal graph is strongly chordal if and only if every cycle on six or more vertices has an induced triangle with exactly two edges of the triangle as the chords of the cycle. (~

Graph Searching on Some Subclasses of Ch

Graph Searching on Some Subclasses of Chordal Graphs

✍ S.-L. Peng; C. Y. Tang; M.-T. Ko; C.-W. Ho; T.-s. Hsu 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 244 KB

Computation of a (canonical) doubly perf

Computation of a (canonical) doubly perfect elimination ordering of a doubly chordal graph

✍ Lee, Mahnhoon ;Kim, Changhwa 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 119 KB

Centers of chordal graphs

✍ Gerard J. Chang 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 505 KB

Some aspects of perfect elimination orde

Some aspects of perfect elimination orderings in chordal graphs

✍ D.R. Shier 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 434 KB