Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture

Related Items (26)

Trees with few leaves in tournaments ⋮ Paths with two blocks in \(k\)-chromatic digraphs ⋮ Antidirected paths in 5-chromatic digraphs ⋮ Antidirected Hamiltonian paths between specified vertices of a tournament ⋮ Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points ⋮ Paths with two blocks in \(n\)-chromatic digraphs ⋮ Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points ⋮ Equitable oriented coloring ⋮ About the number of oriented Hamiltonian paths and cycles in tournaments ⋮ A survey on Hamilton cycles in directed graphs ⋮ The existence of a path with two blocks in digraphs ⋮ Unnamed Item ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ Learnability and rationality of choice. ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Antidirected Hamiltonian paths and directed cycles in tournaments ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the unavoidability of oriented trees ⋮ On the unavoidability of oriented trees ⋮ Parity of paths in tournaments ⋮ Trees with three leaves are (\(n+1\))-unavoidable ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ TILING DIRECTED GRAPHS WITH TOURNAMENTS ⋮ Tournaments and Semicomplete Digraphs ⋮ Oriented Hamiltonian cycles in tournaments

Cites Work

This page was built for publication: Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture