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.
Original language | English (US) |
---|---|
Pages (from-to) | 231-243 |
Number of pages | 13 |
Journal | Journal of Combinatorial Theory. Series B |
Volume | 87 |
Issue number | 2 |
DOIs | |
State | Published - Mar 2003 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Keywords
- Edge partitions
- Small components
- Tree-width
- Vertex partitions