用无爪图中的Tutte路径等价表述Thomassen猜想
Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs
AI总结：
本文将Thomassen猜想与Jackson猜想的等价性进一步推广，证明在每个连通无爪图中任意两点都可由一条极大Tutte路径连接。
摘要：
我们继续研究Thomassen猜想（每个4连通线图都有哈密顿圈），沿着最近证明的与Jackson猜想（每个2连通无爪图都有Tutte圈）的等价性方向，并将等价表述扩展如下：在每个连通无爪图中，任意两个顶点都由一条作为Tutte路径的极大路径连接。
英文摘要：
We continue studying Thomassen's conjecture (every 4-connected line graph has a Hamilton cycle) in the direction of a recently shown equivalence with Jackson's conjecture (every 2-connected claw-free graph has a Tutte cycle), and we extend the equivalent formulation as follows: In each connected claw-free graph, every two vertices are connected by a maximal path which is a Tutte path.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
