Title

Partitioning into graphs with only small components

Document Type

Article

Publication Date

3-1-2003

Abstract

The paper presents several results on edge partitions and vertex partitions of graphs into graphs with bounded size components. We show that every graph of bounded tree-width and bounded maximum degree admits such partitions. We also show that an arbitrary graph of maximum degree four has a vertex partition into two graphs, each of which has components on at most 57 vertices. Some generalizations of the last result are also discussed. © 2002 Elsevier Science (USA). All rights reserved.

Publication Source (Journal or Book title)

Journal of Combinatorial Theory. Series B

First Page

231

Last Page

243

This document is currently not available here.

Share

COinS