✦ LIBER ✦

List matrix partitions of chordal graphs

✍ Scribed by Tomás Feder; Pavol Hell; Sulamita Klein; Loana Tito Nogueira; Fábio Protti

Book ID: 108281110
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 265 KB
Volume: 349
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2005.09.030

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Partitioning Chordal Graphs

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

Matrix Completions and Chordal Graphs

✍ Kenneth John Harrison 📂 Article 📅 2003 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 237 KB

Matrix partitions of perfect graphs

✍ Tomás Feder; Pavol Hell 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 233 KB

List monopolar partitions of claw-free g

List monopolar partitions of claw-free graphs

✍ Ross Churchley; Jing Huang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 193 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