Partitioning into graphs with only small components

Noga Alon, Guoli Ding, Bogdan Oporowski*, Dirk Vertigan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)231-243
Number of pages13
JournalJournal of Combinatorial Theory. Series B
Issue number2
StatePublished - Mar 2003


  • Edge partitions
  • Small components
  • Tree-width
  • Vertex partitions


Dive into the research topics of 'Partitioning into graphs with only small components'. Together they form a unique fingerprint.

Cite this