The following pages link to On Detours in Graphs<sup>1</sup> (Q5554157):
Displaying 15 items.
- Detour trees (Q277622) (← links)
- On non-traceable, non-hypotraceable, arachnoid graphs (Q322337) (← links)
- On constructions of hypotraceable graphs (Q510557) (← links)
- Path spectra for trees (Q607002) (← links)
- A note on path kernels and partitions (Q710611) (← links)
- Nontraceable detour graphs (Q868352) (← links)
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion (Q1028139) (← links)
- Hypohamiltonian and hypotraceable graphs (Q1394359) (← links)
- Gallai's question and constructions of almost hypotraceable graphs (Q1752468) (← links)
- Path partitions and \(P_{n}\)-free sets (Q1763347) (← links)
- Vertices missed by longest paths or circuits (Q2560260) (← links)
- Intersecting longest paths in chordal graphs (Q2685319) (← links)
- Leaf-Critical and Leaf-Stable Graphs (Q2978184) (← links)
- Detour-saturated graphs (Q3022734) (← links)
- On Hypohamiltonian and Almost Hypohamiltonian Graphs (Q5251202) (← links)
