Metraipolis › archive › dc_e36fe31f9053

A 5/4 bound for graphic $s$-$t$ path TSP on subcubic graphs — arXiv:2608.11038

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.11038
License (as archived)
CC0-1.0
Archived
2026-10-19T06:27:34.798Z
SHA-256 of the archived text
a08f412c0f26205600bf32a01ebc1ac8060875c021ef81f827964258919a2eb7
Stable URL of this page
https://metraipolis.com/documento/dc_e36fe31f9053

How to cite

A 5/4 bound for graphic $s$-$t$ path TSP on subcubic graphs — arXiv:2608.11038 — arXiv (en), https://arxiv.org/abs/2608.11038 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e36fe31f9053 (Metraipolis archive dc_e36fe31f9053, sha256 a08f412c0f26205600bf32a01ebc1ac8060875c021ef81f827964258919a2eb7)
BibTeX
@misc{dce36fe31f9053,
  title = {A 5/4 bound for graphic $s$-$t$ path TSP on subcubic graphs — arXiv:2608.11038},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.11038},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e36fe31f9053; sha256 a08f412c0f26205600bf32a01ebc1ac8060875c021ef81f827964258919a2eb7},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.11038. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the graphic $s$-$t$ path TSP on subcubic graphs (maximum degree 3): given distinct vertices $s,t$, find a shortest $s$-$t$ walk that visits every vertex. We prove an upper bound with the asymptotically optimal leading coefficient $5/4$ for every terminal pair, even when $G-\{s,t\}$ is disconnected. Specifically, every simple 2-connected subcubic graph $G$ on $n$ vertices has a spanning $s$-$t$ walk of length at most $\lfloor(5n+n_2(G))/4\rfloor$, where $n_2(G)$ counts its degree-2 vertices. An $O(n^2)$-time algorithm attains this bound. Combining an edge-rooted even-cover theorem of Wigal, Yoo, and Yu (WYY) with an even-cover-to-walk lemma proved here yields this bound for adjacent terminals, a consequence not stated explicitly in their paper. We extend the bound to arbitrary terminal pairs. For cubic graphs, it becomes $\lfloor 5n/4 \rfloor$, to our knowledge the first direct $5/4$ bound for cubic path TSP that does not use the general path-to-tour reduction.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-12 in math.CO).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Discrete Mathematics (cs.DM); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.11038 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T06:20:30.703Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-12?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).