A partial k-arboretum of graphs with bounded treewidth

H.L. Bodlaender

Research output: Contribution to journalArticleAcademicpeer-review

681 Citations (Scopus)


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.
Original languageEnglish
Pages (from-to)1-45
Number of pages45
JournalTheoretical Computer Science
Issue number1–2
Publication statusPublished - 1998
Externally publishedYes


  • Graph classes
  • Partial k-tree
  • Treewidth


Dive into the research topics of 'A partial k-arboretum of graphs with bounded treewidth'. Together they form a unique fingerprint.

Cite this