Document Type

Article

Publication Date

2-22-1996

Abstract

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.

Publication Source (Journal or Book title)

Discrete Mathematics

First Page

45

Last Page

58

Download
COinS