A Note on Edge-Disjoint Hamilton Cycles in Line Graphs

Hao Li,Weihua He,Weihua Yang,Yandong Bai

Graphs and Combinatorics（2015）

引用 6|浏览10

暂无评分

摘要

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 4 k has k edge-disjoint spanning closed trails, then L ( G ) contains k edge-disjoint Hamilton cycles.

查看译文

关键词

Hamilton cycle,Edge-disjoint Hamilton cycles,Line graph

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要