Nontraceable detour graphs

DOI10.1016/J.DISC.2006.07.019zbMath1113.05052OpenAlexW1993040197MaRDI QIDQ868352

Marietjie Frick, Róbert Vlačuha, Frank Bullock, Gabriel Semanisin

Publication date: 2 March 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.07.019

zbMATH Keywords

longest pathdetour orderdetour sequence

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Related Items (2)

On detour homogeneous digraphs ⋮ The open detour number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
• Smallest maximally nonhamiltonian graphs
• Eccentric sequences in graphs
• A remark on the existence of finite graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• Degrees in Homogeneously Traceable Graphs
• A survey of hereditary properties of graphs
• Detour Chromatic Numbers
• On Detours in Graphs¹

This page was built for publication: Nontraceable detour graphs