𝔖 Bobbio Scriptorium
✦   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

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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