Detours In Graphs
Detours In Graphs
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.
Frank Bullock
数学
Frank Bullock.Detours In Graphs[EB/OL].(2025-07-16)[2025-08-18].https://arxiv.org/abs/2507.12086.点此复制
评论