✦ LIBER ✦

Connected graph searching in chordal graphs

✍ Scribed by Nicolas Nisse

Book ID: 108112786
Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 826 KB
Volume: 157
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2008.08.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Connectivity threshold for random chorda

Connectivity threshold for random chordal graphs

✍ F. R. McMorris; Edward R. Scheinerman 📂 Article 📅 1991 🏛 Springer Japan 🌐 English ⚖ 309 KB

Connected graph searching

✍ Lali Barrière; Paola Flocchini; Fedor V. Fomin; Pierre Fraigniaud; Nicolas Nisse 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 315 KB

Equistable chordal graphs

✍ Uri N. Peled; Udi Rotics 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 130 KB

A graph is called equistable when there is a non-negative weight function on its vertices such that a set S of vertices has total weight 1 if and only if S is maximal stable. We show that a chordal graph is equistable if and only if every two adjacent non-simplicial vertices have a common simplicial

Partitioning Chordal Graphs

✍ Tomás Feder; Pavol Hell; Shekoofeh Nekooei Rizi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 182 KB

Reduced clique graphs of chordal graphs

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