期刊
GRAPHS AND COMBINATORICS
卷 32, 期 2, 页码 741-744出版社
SPRINGER JAPAN KK
DOI: 10.1007/s00373-015-1606-6
关键词
Hamilton cycle; Edge-disjoint Hamilton cycles; Line graph
类别
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据