| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10328490 | Discrete Applied Mathematics | 2005 | 16 Pages |
Abstract
We generalize tree-decompositions to decompositions modelled on graphs other than trees, and study how such more general decompositions might be used to establish structural complexity hierarchies of graph properties.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Reinhard Diestel, Daniela Kühn,