Saved in:
| Main Authors: | , , |
|---|---|
| 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!
|
| _version_ | 1866913724656254976 |
|---|---|
| author | Kabela, Adam Ryjáček, Zdeněk Vrána, Petr |
| author_facet | Kabela, Adam Ryjáček, Zdeněk Vrána, Petr |
| 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1907_08029 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs Kabela, Adam Ryjáček, Zdeněk Vrána, Petr Combinatorics 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. |
| title | Equivalent formulation of Thomassen's conjecture using Tutte paths in claw-free graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/1907.08029 |