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

DOI10.1007/S00373-013-1312-1zbMATH Open1298.05152OpenAlexW2031908930MaRDI QIDQ742591FDOQ742591

Authors: Susan Van Aardt, Marietjie Frick, Bernardo Llano, A. P. Burger, Rita Zuazua 

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

Recommendations

• Publication:4351082
• Hypohamiltonian oriented graphs of all possible orders
• The order of hypotraceable oriented graphs
• The existence of planar hypotraceable oriented graphs
• Planar hypohamiltonian oriented graphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

• Planar hypohamiltonian oriented graphs
• Title not available (Why is that?)
• \(K_2\)-Hamiltonian graphs: I
• On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
• A linear bound towards the traceability conjecture
• Hypohamiltonian oriented graphs of all possible orders
• K₂‐Hamiltonian graphs: II
• New Infinite Families of 2-Edge-Balanced Graphs
• On a conjecture of Grünbaum on longest cycles
• Every 8-traceable oriented graph is traceable

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742591)