On the number of Hamiltonian cycles in tournaments

DOI10.1016/0012-365X(80)90142-9zbMath0439.05031MaRDI QIDQ1142228

Carsten Thomassen

Publication date: 1980

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

zbMATH Keywords

Hamiltonian cyclesHamiltonian pathsstrong tournamentHamiltonian bypasses

Mathematics Subject Classification ID

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

Related Items

Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d ⋮ Whitney's 2-switching theorem, cycle spaces, and arc mappings of directed graphs ⋮ About the number of oriented Hamiltonian paths and cycles in tournaments ⋮ About the number of directed paths in tournaments

Cites Work

• Parallel concepts in graph theory
• Cycles in k-strong tournaments
• Tournaments That Admit Exactly One Hamiltonian Circuit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item