Computing bounded-width tree and branch decompositions of k-outerplanar graphs

Ioannis Katsikarelis

By a well known result the treewidth of k-outerplanar graphs is at most 3k-1. This paper gives, besides a rigorous proof of this fact, an algorithmic implementation of the proof, i…