About the number of oriented Hamiltonian paths and cycles in tournaments

DOI10.1002/JGT.22894MaRDI QIDQ6094043zbMATH OpenFDO

Authors 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 cycleHamiltonian pathtournament

Mathematics Subject Classification ID

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

Abstract: We prove that a tournament and its complement contain the same number of oriented Hamiltonian paths (resp. cycles) of any given type, as a generalization of Rosenfeld's result proved for antidirected paths.

Recommendations

• Oriented Hamiltonian cycles in tournaments
• On the Number of Hamiltonian Cycles in a Tournament
• scientific article; zbMATH DE number 3977040
• On the maximum number of Hamiltonian paths in tournaments
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• The maximum number of Hamiltonian paths in tournaments
• Hamiltonian paths and cycles in hypertournaments
• A note on the number of Hamiltonian paths in strong tournaments
• scientific article; zbMATH DE number 3884197

Cites work

• A note on the number of Hamiltonian paths in strong tournaments
• Antidirected Hamiltonian circuits in tournaments
• Antidirected Hamiltonian paths in tournaments
• Antidirected Hamiltonian paths in tournaments
• scientific article; zbMATH DE number 3150485 (Why is no real title available?)
• scientific article; zbMATH DE number 5178703 (Why is no real title available?)
• scientific article; zbMATH DE number 3013308 (Why is no real title available?)
• scientific article; zbMATH DE number 3412672 (Why is no real title available?)
• scientific article; zbMATH DE number 3102313 (Why is no real title available?)
• On the number of Hamiltonian cycles in tournaments
• Oriented Hamiltonian cycles in tournaments
• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Paths and Cycles in Tournaments
• The maximum number of Hamiltonian paths in tournaments

Cited in

(14)

• Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
• Antidirected Hamiltonian paths and directed cycles in tournaments
• The maximum number of Hamiltonian paths in tournaments
• About the number of directed paths in tournaments
• Counting orientations of graphs with no strongly connected tournaments
• On the maximum number of Hamiltonian paths in tournaments
• scientific article; zbMATH DE number 3884197 (Why is no real title available?)
• scientific article; zbMATH DE number 3914358 (Why is no real title available?)
• scientific article; zbMATH DE number 3977040 (Why is no real title available?)
• scientific article; zbMATH DE number 1539540 (Why is no real title available?)
• Non-Hamiltonian cycles in tournaments
• Number of subgraphs and their converses in tournaments and new digraph polynomials
• Covering relations, closest orderings and Hamiltonian bypaths in tournaments
• A note on the number of Hamiltonian paths in strong tournaments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094043)