𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

✍ Scribed by Marthe Bonamy, Matthew Johnson, Ioannis Lignos…

Book ID
120694155
Publisher
Springer US
Year
2012
Tongue
English
Weight
447 KB
Volume
27
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Treewidth of Chordal Bipartite Graphs
Treewidth of Chordal Bipartite Graphs
✍ T. Kloks; D. Kratsch 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 743 KB

Chordal bipartite graphs are exactly those bipartite graphs in which every cycle of length at least six has a chord. The treewidth of a graph \(G\) is the smallest maximum cliquesize among all chordal supergraphs of \(G\) decreased by one. We present a polynomial time algorithm for the exact computa

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

Perfect Elimination and Chordal Bipartit
Perfect Elimination and Chordal Bipartite Graphs
✍ Martin Charles Golumbic; Clinton F. Goss 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 348 KB

## Abstract We define two types of bipartite graphs, chordal bipartite graphs and perfect elimination bipartite graphs, and prove theorems analogous to those of Dirac and Rose for chordal graphs (rigid circuit graphs, triangulated graphs). Our results are applicable to Gaussian elimination on spars