@article{679564c57a4d4d21adc0999e47d8c6b9,
title = "Partitioning into graphs with only small components",
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.",
keywords = "Edge partitions, Small components, Tree-width, Vertex partitions",
author = "Noga Alon and Guoli Ding and Bogdan Oporowski and Dirk Vertigan",
year = "2003",
month = mar,
doi = "10.1016/S0095-8956(02)00006-0",
language = "אנגלית",
volume = "87",
pages = "231--243",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",
number = "2",
}