Saved in:
Bibliographic Details
Main Authors: Kabela, Adam, Ryjáček, Zdeněk, Vrána, Petr
Format: Preprint
Published: 2019
Subjects:
Online Access:https://arxiv.org/abs/1907.08029
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • 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.