Author/Authors :
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.، نويسنده ,
