Parity of paths and circuits in tournaments
From MaRDI portal
Publication:2562792
DOI10.1016/0012-365X(73)90041-1zbMath0268.05108MaRDI QIDQ2562792
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The complexity of finding certain trees in tournaments ⋮ Antidirected Hamiltonian circuits in tournaments ⋮ Realization of certain generalized paths in tournaments ⋮ Antidirected Hamiltonian paths and directed cycles in tournaments ⋮ Paths and Cycles in Tournaments ⋮ Ramsey numbers for tournaments ⋮ 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 ⋮ Tournaments and Semicomplete Digraphs ⋮ Largest digraphs contained in all n-tournaments
Cites Work
This page was built for publication: Parity of paths and circuits in tournaments
