Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Note on Factorization of Complete Graphs into Caterpillars with Small Diameters

Dalibor Froncek1
1 University of Minnesota Duluth
  • Published: 31/05/2006

Abstract

We prove in this note that certain caterpillars with diameter 4 or 5 do not factorize complete graphs. This together with results by Kovarova [2,3] and Kubesa [5] gives the complete characterization of the caterpillars with diameter 4 that factorize the complete graph \( K_{2n} \). For diameter 5, we again complement results by Kovarova [4] and Kubesa [6-9] to give the complete characterization for certain class of caterpillars.

Keywords: Graph factorization, spanning trees. Research for this article was supported by the University of Minnesota Duluth Grant 177–1009.
Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Dalibor Froncek. Note on Factorization of Complete Graphs into Caterpillars with Small Diameters[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 057. 179-186. DOI: .