Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three

DOI10.1016/J.DISC.2010.03.003zbMath1222.05123OpenAlexW2005494153MaRDI QIDQ973120

Dirk Meierling

Publication date: 28 May 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.003

zbMATH Keywords

number of cycleslocal tournament

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments ⋮ Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs ⋮ Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments

Cites Work

• Unnamed Item
• On the number of cycles in local tournaments
• A classification of locally semicomplete digraphs
• Hamiltonian tournaments with the least number of 3-cycles
• Locally semicomplete digraphs: A generalization of tournaments
• Connectivity properties of locally semicomplete digraphs
• Digraphs
• On Subtournaments of a Tournament
• Tournaments That Admit Exactly One Hamiltonian Circuit

This page was built for publication: Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three