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.
Original language | English |
---|---|
Pages (from-to) | 1-45 |
Number of pages | 45 |
Journal | Theoretical Computer Science |
Volume | 209 |
Issue number | 1–2 |
DOIs | |
Publication status | Published - 1998 |
Externally published | Yes |
Keywords
- Graph classes
- Partial k-tree
- Treewidth