The order of hypotraceable oriented graphs
From MaRDI portal
Publication:2275358
Recommendations
Cites work
- A traceability conjecture for oriented graphs
- Digraphs. Theory, algorithms and applications
- 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 3641470 (Why is no real title available?)
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- Hypotraceable digraphs
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets
- On the structure of the monotone asymmetric travelling salesman polytope II: Hypotraceable facets
- Progress on the traceability conjecture for oriented graphs
- Traceability of k-traceable oriented graphs
Cited in
(11)- Ordered \(h\)-level graphs on the BSP model
- Homogeneously orderable graphs
- Every 8-traceable oriented graph is traceable
- scientific article; zbMATH DE number 3849274 (Why is no real title available?)
- An infinite family of planar hypohamiltonian oriented graphs
- Computational results on the traceability of oriented graphs of small order
- The existence of planar hypotraceable oriented graphs
- Forbidden subdigraphs conditions on the traceability conjecture
- Helly-type theorems for the ordering of the vertices of a hypergraph
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
- A linear bound towards the traceability conjecture
This page was built for publication: The order of hypotraceable oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2275358)