Graph minor hierarchies

Authors:
Reinhard Diestel;Daniela Kühn
Affiliations:
Mathematisches Seminar, Universität Hamburg, Bundesstrasse 55, Hamburg 20146, Germany;Mathematisches Seminar, Universität Hamburg, Bundesstrasse 55, Hamburg 20146, Germany
Venue:
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Year:
2005

Citing 2
Cited 2

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
Highly connected sets and the excluded grid theorem

Journal of Combinatorial Theory Series B

Improved upper bounds on the crossing number

Proceedings of the twenty-fourth annual symposium on Computational geometry
On tree-partition-width

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

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.