A Note on Edge-Disjoint Hamilton Cycles in Line Graphs
- 263 Downloads
It is well known that if a graph G contains a spanning closed trail, then its line graph L(G) is Hamiltonian. In this note, it is proved that if a graph G with minimum degree at least 4k has k edge-disjoint spanning closed trails, then L(G) contains k edge-disjoint Hamilton cycles.
KeywordsHamilton cycle Edge-disjoint Hamilton cycles Line graph
The authors thank the referees for their valuable comments that improved the presentation.