𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitioning Chordal Graphs

✍ Scribed by Tomás Feder; Pavol Hell; Shekoofeh Nekooei Rizi

Book ID
119236575
Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
182 KB
Volume
38
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex partitions of chordal graphs
Vertex partitions of chordal graphs
✍ David R. Wood 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 103 KB

## Abstract A __k‐tree__ is a chordal graph with no (__k__ + 2)‐clique. An ℓ‐__tree‐partition__ of a graph __G__ is a vertex partition of __G__ into ‘bags,’ such that contracting each bag to a single vertex gives an ℓ‐tree (after deleting loops and replacing parallel edges by a single edge). We pro

List matrix partitions of chordal graphs
List matrix partitions of chordal graphs
✍ Tomás Feder; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 265 KB
Partitioning chordal graphs into indepen
Partitioning chordal graphs into independent sets and cliques
✍ Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 217 KB

We consider the following generalization of split graphs: A graph is said to be a (k; ')-graph if its vertex set can be partitioned into k independent sets and ' cliques. (Split graphs are obtained by setting k = ' = 1.) Much of the appeal of split graphs is due to the fact that they are chordal, a

Equistable chordal graphs
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