A partial k-arboretum of graphs with bounded treewidth (1998)
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.
A really good survey of treewidth literature and the various definitions of treewidth. Also contains a number of possibly useful statements about graphs with a certain treewidth. Various other treewidth like metrics such as pathwidth and branchwidth are also discussed.