Title of article
Factorizations of complete graphs into caterpillars of diameter 5
Author/Authors
Dalibor Froncek، نويسنده , , Dalibor and Kov??، نويسنده , , Petr and Kov??ov?، نويسنده , , Tereza and Kubesa، نويسنده , , Michael، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
20
From page
537
To page
556
Abstract
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 .
Keywords
graph factorization , spanning trees , Graph labeling
Journal title
Discrete Mathematics
Serial Year
2010
Journal title
Discrete Mathematics
Record number
1599268
Link To Document