Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
From MaRDI portal
(Redirected from Publication:742591)
Recommendations
Cites work
- scientific article; zbMATH DE number 3849274 (Why is no real title available?)
- scientific article; zbMATH DE number 3577225 (Why is no real title available?)
- scientific article; zbMATH DE number 1052842 (Why is no real title available?)
- scientific article; zbMATH DE number 3046846 (Why is no real title available?)
- A traceability conjecture for oriented graphs
- A two-connected planar graph without concurrent longest paths
- An infinite family of planar hypohamiltonian oriented graphs
- An iterative approach to the traceability conjecture for oriented graphs
- Computational results on the traceability of oriented graphs of small order
- Digraphs
- Hypotraceable digraphs
- On longest paths and circuits in graphs.
- On non-Hamiltonian circulant digraphs of outdegree three
- Progress on the traceability conjecture for oriented graphs
- The order of hypotraceable oriented graphs
- Traceability of \(k\)-traceable oriented graphs
- Vertices missed by longest paths or circuits
- When the cartesian product of two directed cycles is hypo-Hamiltonian
Cited in
(10)- \(K_2\)-Hamiltonian graphs: I
- On a conjecture of Grünbaum on longest cycles
- On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
- scientific article; zbMATH DE number 1052842 (Why is no real title available?)
- A linear bound towards the traceability conjecture
- Hypohamiltonian oriented graphs of all possible orders
- New Infinite Families of 2-Edge-Balanced Graphs
- K2‐Hamiltonian graphs: II
- Every 8-traceable oriented graph is traceable
- Planar hypohamiltonian oriented graphs
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)