Every 3-Connected {K-1,K-3, Z(7)}-Free Graph Of Order At Least 21 Is Hamilton-Connected

DISCRETE MATHEMATICS（2021）

引用 4|浏览4

暂无评分

摘要

For an integer i >= 1, Z(i) is the graph obtained by attaching an endvertex of a path of length i to a vertex of a triangle. We prove that every 3-connected {K-1,K-3, Z(7)}-free graph is Hamilton-connected, with one exceptional graph. The result is sharp. (c) 2021 Elsevier B.V. All rights reserved.

查看译文

关键词

Hamilton-connected, Closure, Forbidden subgraph, Claw-free, Z(i)-free

AI 理解论文

溯源树

样例

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

Chat Paper

正在生成论文摘要