A Partial k-Arboretum of Graphs with Bounded Treewidth

The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. This survey paper wants to give an overview of many classes of graphs that can be seen to have a uniform upper bound on the treewidth of graphs in the class. Also, some mutual relations between such classes are discussed.

• Type: Journal
• Year: 1998
• Where: TCS
• Authors: Hans L. Bodlaender
• Keywords: Graph Algorithmic Studies, Powerful Vehicle, TCS 1998, Theoretical Computer Science, Uniform Upper Bound