On hamiltonian cycles in claw-free cubic graphs

DISCUSSIONES MATHEMATICAE GRAPH THEORY（2022）

引用 0|浏览14

暂无评分

摘要

We show that every claw-free cubic graph of order n at least 8 has at most 2[n/4] Hamiltonian cycles, and we also characterize all extremal graphs.

查看译文

关键词

Hamiltonian cycle,claw-free graph,cubic graph

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要