On tree-partitions of graphs

A graph G admits a tree-partition of width k if its vertex set can be partitioned into sets of size at most k so that the graph obtained by identifying the vertices in each set of the partition, and then deleting loops and parallel edges, is a forest. In the paper, we characterize the classes of graphs (finite and infinite) of bounded tree-partition-width in terms of excluded topological minors.

[1]  Detlef Seese,et al.  Tree-partite graphs and the complexity of algorithms , 1985, FCT.

[2]  Robin Thomas,et al.  Quickly Excluding a Planar Graph , 1994, J. Comb. Theory, Ser. B.

[3]  Bogdan Oporowski,et al.  Some results on tree decomposition of graphs , 1995, J. Graph Theory.

[4]  Robin Thomas,et al.  The menger-like property of the tree-width of infinite graphs , 1991, J. Comb. Theory, Ser. B.

[5]  Paul D. Seymour,et al.  Graph minors. III. Planar tree-width , 1984, J. Comb. Theory B.

[6]  Rudolf Halin,et al.  Tree-partitions of infinite graphs , 1991, Discret. Math..

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