| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4649505 | Discrete Mathematics | 2010 | 20 Pages |
Abstract
We examine factorizations of complete graphs K2nK2n 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 K2nK2n.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Dalibor Fronček, Petr Kovář, Tereza Kovářová, Michael Kubesa,