Graph minor hierarchies

Discrete Applied Mathematics

Volumn 145, Issue 2, 2005, Pages 167-182

  Diestel, Reinhard ^a   Kühn, Daniela ^a  

^a UNIVERSITY OF HAMBURG   (Germany)

Author keywords

Decomposition; Graph minors; Grid width; Hierarchy; Tree width

Indexed keywords

COMPUTER SIMULATION; FUNCTIONS; HIERARCHICAL SYSTEMS; MAPPING; SET THEORY; THEOREM PROVING;

GRAPH MINORS; GRID-WIDTH; HIERARCHY; TREE-WIDTH;

TREES (MATHEMATICS);

EID: 8344275861     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.01.010     Document Type: Article

References (9)

1. A. Bondy, M. Simonovits, Cycles of even length in graphs, J. Combin. Theory B 16 (1974) 97-105.
2. R. Diestel, Graph Theory, second ed., Springer, Berlin, 2000 http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/download.html.
3. R. Diestel, Graph minors I: a short proof of the path width theorem, Combin. Probab. Comput. 4 (1995) 27-30.
4. R. Diestel, Relating subsets of a poset, and a partition theorem for WQOs, Order 18 (2001) 275-279.
5. R. Diestel, K.Y. Gorbunov, T.R. Jensen, C. Thomassen, Highly connected sets and the excluded grid theorem, J. Combin. Theory B 75 (1999) 61-73.
6. R. Diestel, D. Kühn, Tree hierarchies, manuscripts 2000.
7. P. Erdos, Extremal problems in graph theory, in; M. Fiedler (Ed.), Theory of Graphs and its Applications, Proceedings of the Symposium, Smolenice, 1963, Academic Press, New York, 1965, pp. 29-36.
8. N. Robertson, P.D. Seymour, Graph minors. I. Excluding a forest, J. Combin. Theory B 35 (1983) 39-61.
9. N. Robertson, P.D. Seymour, Graph minors. V. Excluding a planar graph, 3. Combin. Theory B 41 (1986) 92-114.