About the number of oriented Hamiltonian paths and cycles in tournaments

DOI10.1002/jgt.22894zbMath1522.05203arXiv2101.00713MaRDI QIDQ6094043

Amine El Sahili, Zeina Ghazo Hanna

Publication date: 9 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2101.00713

zbMATH Keywords

digraphHamiltonian cycletournamentHamiltonian path

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• A note on the number of Hamiltonian paths in strong tournaments
• On the number of Hamiltonian cycles in tournaments
• Antidirected Hamiltonian circuits in tournaments
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Oriented Hamiltonian cycles in tournaments
• The maximum number of Hamiltonian paths in tournaments
• Paths and Cycles in Tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: About the number of oriented Hamiltonian paths and cycles in tournaments