Abstract

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 computation of the treewidth of all chordal bipartite graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call