TL;DR
This paper investigates the properties of detours, or longest paths, in specific classes of graphs, focusing on graphs where each vertex can be a start or end of such a path, and explores related graph structures.
Contribution
It introduces new results on connected, non-traceable graphs with vertices serving as detour endpoints, including special cases like claw-free and 2-connected graphs.
Findings
Characterization of graphs where each vertex is an endpoint of a detour
Results on claw-free, 2-connected, non-traceable graphs
Analysis of maximal non-traceable graphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBayesian Modeling and Causal Inference