## A Partial K-Arboretum of Graphs With Bounded Treewidth (1998)

by
Hans L. Bodlaender

Venue: | J. Algorithms |

Citations: | 251 - 36 self |

### BibTeX

@INPROCEEDINGS{Bodlaender98apartial,

author = {Hans L. Bodlaender},

title = {A Partial K-Arboretum of Graphs With Bounded Treewidth},

booktitle = {J. Algorithms},

year = {1998},

pages = {1--16},

publisher = {Springer}

}

### Years of Citing Articles

### OpenURL

### 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.