加载中…
2025-07-16
Detours In Graphs
Frank Bullock
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本