Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs

DOI10.1007/s00373-013-1312-1zbMath1298.05152OpenAlexW2031908930MaRDI QIDQ742591

Marietjie Frick, Susan A. van Aardt, Bernardo Llano, Rita E. Zuazua, Alewyn P. Burger

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1312-1

zbMATH Keywords

hypotraceablepath partition conjecturetraceability conjecture2-hypohamiltonian2-hypotraceablehypo-hypohamiltonianhypo-hypotraceablehypohamiltonian

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (8)

Every 8-traceable oriented graph is traceable ⋮ Planar hypohamiltonian oriented graphs ⋮ On a conjecture of Grünbaum on longest cycles ⋮ A linear bound towards the traceability conjecture ⋮ On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs ⋮ Hypohamiltonian oriented graphs of all possible orders ⋮ K₂‐Hamiltonian graphs: II ⋮ $K_2$-Hamiltonian Graphs: I

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An infinite family of planar hypohamiltonian oriented graphs
• Computational results on the traceability of oriented graphs of small order
• Traceability of \(k\)-traceable oriented graphs
• A traceability conjecture for oriented graphs
• An iterative approach to the traceability conjecture for oriented graphs
• The order of hypotraceable oriented graphs
• A two-connected planar graph without concurrent longest paths
• Vertices missed by longest paths or circuits
• When the cartesian product of two directed cycles is hypo-Hamiltonian
• Hypotraceable digraphs
• On longest paths and circuits in graphs.
• On non-Hamiltonian circulant digraphs of outdegree three
• Digraphs

This page was built for publication: Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs