Realization of certain generalized paths in tournaments

DOI10.1016/0012-365X(81)90068-6zbMath0453.05031OpenAlexW2006305228MaRDI QIDQ1148916

Moshe Rosenfeld, Brian Alspach

Publication date: 1981

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(81)90068-6

zbMATH Keywords

tournamentsgeneralized paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

The complexity of finding certain trees in tournaments ⋮ On claws belonging to every tournament ⋮ Claws contained in all \(n\)-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 ⋮ On avoidable and unavoidable claws ⋮ Largest digraphs contained in all n-tournaments

Cites Work

• Parallel concepts in graph theory
• Antidirected Hamiltonian circuits in tournaments
• Parity of paths and circuits in tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments

This page was built for publication: Realization of certain generalized paths in tournaments