Partitioning graphs of bounded tree-width

Document Type

Article

Publication Date

1-1-1998

Abstract

The paper discusses vertex partitions and edge partitions of graphs of bounded tree-width into graphs of smaller tree-width. The first part of the paper proves the existence of several kinds of such partitions. The second part, which has a Ramsey-theoretic character, shows that some of the results of the first part are close to being best possible. The last section of the paper presents a result on partitioning graphs of bounded tree-width into star-forests.

Publication Source (Journal or Book title)

Combinatorica

First Page

1

Last Page

12

This document is currently not available here.

Share

COinS