Nontraceable detour graphs
From MaRDI portal
Publication:868352
DOI10.1016/J.DISC.2006.07.019zbMATH Open1113.05052OpenAlexW1993040197MaRDI QIDQ868352FDOQ868352
Marietjie Frick, Róbert Vlačuha, Gabriel Semanišin, Frank Bullock
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
Recommendations
- Detours in directed graphs
- Non-intersecting detours in strong oriented graphs
- scientific article; zbMATH DE number 2170458
- Detour graphs
- Detour-saturated graphs
- On edge detour graphs
- scientific article; zbMATH DE number 3966121
- scientific article
- scientific article; zbMATH DE number 6729997
- Edge detour graphs
Cites Work
- Title not available (Why is that?)
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- A survey of hereditary properties of graphs
- A remark on the existence of finite graphs
- On Detours in Graphs1
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Smallest maximally nonhamiltonian graphs
- Eccentric sequences in graphs
- Title not available (Why is that?)
- Degrees in Homogeneously Traceable Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Detour Chromatic Numbers
- Smallest claw-free, 2-connected, nontraceable graphs and the construction of maximal nontraceable graphs
Cited In (3)
This page was built for publication: Nontraceable detour graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868352)