Factorizations of complete graphs into caterpillars of diameter 5

Dalibor Froncek, Petr Kovář, Tereza Kovářová, Michael Kubesa

Research output: Contribution to journalArticlepeer-review

3 Scopus citations


We examine factorizations of complete graphs K2 n into caterpillars of diameter 5. First we present a construction generalizing some previously known methods. Then we use the new method along with some previous partial results to give a complete characterization of caterpillars of diameter 5, which factorize the complete graph K2 n.

Original languageEnglish (US)
Pages (from-to)537-556
Number of pages20
JournalDiscrete Mathematics
Issue number3
StatePublished - Feb 6 2010
Externally publishedYes


  • Graph factorization
  • Graph labeling
  • Spanning trees


Dive into the research topics of 'Factorizations of complete graphs into caterpillars of diameter 5'. Together they form a unique fingerprint.

Cite this