Jackson's Tutte-cycle conjecture for 2-connected claw-free graphs
A graph is claw-free if it has no induced subgraph isomorphic to . A graph is 2-connected if it is connected and remains connected after deleting any one vertex. A Tutte cycle is a cycle such that every component of has at most three neighbours on .
Jackson's conjecture. Every -connected claw-free graph has a Tutte cycle.
This is presented as an equivalent formulation of Thomassen's open conjecture on Hamilton cycles in 4-connected line graphs. The equivalence is obtained using the closure technique, but the conjecture itself remains unresolved.
References
- Adam Kabela, Zdeněk Ryjáček and Petr Vrána, “Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs”, arXiv:1907.08029 (2025).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.