Abstract
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 language | English (US) |
---|---|
Pages (from-to) | 537-556 |
Number of pages | 20 |
Journal | Discrete Mathematics |
Volume | 310 |
Issue number | 3 |
DOIs | |
State | Published - Feb 6 2010 |
Externally published | Yes |
Keywords
- Graph factorization
- Graph labeling
- Spanning trees