Factorizations of complete graphs into caterpillars of diameter 5

摘要

We examine factorizations of complete graphs K_(2 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 K_(2 n).