论文信息 - Graph minor hierarchies

Graph minor hierarchies

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.

Reinhard Diestel | Daniela Kühn | Daniela Kühn | R. Diestel

[1] M. Simonovits,et al. Cycles of even length in graphs , 1974 .

[2] Béla Bollobás,et al. Extremal problems in graph theory , 1977, J. Graph Theory.

[3] Reinhard Diestel. Relating Subsets of a Poset, and a Partition Theorem for WQOs , 2001, Order.

[4] Paul D. Seymour,et al. Graph Minors: XV. Giant Steps , 1996, J. Comb. Theory, Ser. B.

[5] Paul D. Seymour,et al. Graph minors. V. Excluding a planar graph , 1986, J. Comb. Theory B.

[6] Reinhard Diestel,et al. Graph Minors I: A Short Proof of the Path-width Theorem , 1995, Combinatorics, Probability and Computing.

[7] Reinhard Diestel,et al. Graph Theory , 1997 .

[8] Carsten Thomassen,et al. Highly Connected Sets and the Excluded Grid Theorem , 1999, J. Comb. Theory, Ser. B.

[9] Claude Berge. Theory of graphs and its applications , 1962 .

[10] Paul D. Seymour,et al. Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[11] Christopher M. Hartman. Extremal problems in graph theory , 1997 .