✦ LIBER ✦

Contracting chordal graphs and bipartite graphs to paths and trees

✍ Scribed by Heggernes, Pinar; van ’t Hof, Pim; Lévêque, Benjamin; Paul, Christophe

Book ID: 121947366
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 384 KB
Volume: 164
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.02.025

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Contracting Graphs to Paths and Trees

✍ Heggernes, Pinar; Hof, Pim; Lévêque, Benjamin; Lokshtanov, Daniel; Paul, Christo 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 838 KB

Chordal bipartite graphs and crowns

✍ Vincent Bouchitté 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 178 KB

Strongly chordal and chordal bipartite g

Strongly chordal and chordal bipartite graphs are

✍ Pinar Heggernes; Federico Mancini; Charis Papadopoulos; R. Sritharan 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 634 KB

Chordal bipartite graphs of bounded tree

Chordal bipartite graphs of bounded tree- and clique-width

✍ V. Lozin; D. Rautenbach 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Reconfiguration graphs for vertex colour

Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs

✍ Marthe Bonamy, Matthew Johnson, Ioannis Lignos… 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 447 KB

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