Detours In Graphs
Combinatorics
2025-07-17 v1
Abstract
A detour in a graph is a longest path. This thesis is mainly about connected, non-traceable graphs with the property that each vertex is the start (or end) vertex of a detour. There are also related results on claw-free, 2-connected, non-traceable graphs, and maximal non-traceable graphs.
Keywords
Cite
@article{arxiv.2507.12086,
title = {Detours In Graphs},
author = {Frank Bullock},
journal= {arXiv preprint arXiv:2507.12086},
year = {2025}
}
Comments
93 pages, 37 figures. PhD thesis