Thesis reveals properties of connected and non-traceable graphs, highlighting vertex detours.
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.
No takes yet. Share an insight, caveat, or question.
Frank Bullock (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: