A partial k-arboretum of graphs with bounded treewidth

Abstract

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. © 1998 - Elsevier Science B.V. All rights reserved.