Antidirected Hamiltonian paths in tournaments
From MaRDI portal
Publication:5921444
DOI10.1016/0095-8956(72)90035-4zbMath0229.05119OpenAlexW1972435532MaRDI QIDQ5921444
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90035-4
Related Items (25)
Trees with few leaves in tournaments ⋮ Antidirected Hamiltonian paths between specified vertices of a tournament ⋮ Arc reversals of cycles in orientations of \(G\) vertex-multiplications ⋮ The complexity of finding certain trees in tournaments ⋮ Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points ⋮ Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points ⋮ Antidirected Hamiltonian circuits in tournaments ⋮ Antidirected spanning closed trail in tournaments ⋮ About the number of oriented Hamiltonian paths and cycles in tournaments ⋮ Ore conditions for antistrong digraphs ⋮ Realization of certain generalized paths in tournaments ⋮ Antidirected Hamiltonian paths and cycles of digraphs with \(\alpha_2\)-stable number 2 ⋮ NC algorithms for antidirected hamiltonian paths and cycles in tournaments ⋮ Anti-Eulerian digraphs ⋮ Antidirected Hamiltonian paths and directed cycles in tournaments ⋮ Paths and Cycles in Tournaments ⋮ Ramsey numbers for tournaments ⋮ Matroids from directed graphs ⋮ On the unavoidability of oriented trees ⋮ On the unavoidability of oriented trees ⋮ Parity of paths in tournaments ⋮ Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture ⋮ Antidirected Hamilton circuits and paths in tournaments ⋮ Parity of paths and circuits in tournaments ⋮ Tournaments and Semicomplete Digraphs
Cites Work
This page was built for publication: Antidirected Hamiltonian paths in tournaments
