𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Several results on chordal bipartite graphs

✍ Scribed by Mihály Bakonyi; Aaron Bono


Book ID
110425479
Publisher
Springer
Year
1997
Tongue
English
Weight
432 KB
Volume
47
Category
Article
ISSN
0011-4642

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


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