Oriented Hamiltonian cycles in tournaments

DOI10.1006/jctb.2000.1959zbMath1026.05052OpenAlexW1972602431MaRDI QIDQ1850481

Frédéric Havet

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:491a9bf1-2f73-4615-9640-d0d46b1a012f

Mathematics Subject Classification ID

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

Related Items

Almost symmetric cycles in large digraphs, About the number of oriented Hamiltonian paths and cycles in tournaments, A survey on Hamilton cycles in directed graphs, Learnability and rationality of choice., Antidirected Hamiltonian paths and directed cycles in tournaments, Tournaments and Semicomplete Digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Antidirected Hamiltonian circuits in tournaments
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Antidirected Hamilton circuits and paths in tournaments
• On the existence of specified cycles in a tournament
• Paths and Cycles in Tournaments