On the number of cycles in local tournaments
From MaRDI portal
Publication:1025457
DOI10.1016/j.disc.2008.04.015zbMath1229.05110MaRDI QIDQ1025457
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.04.015
Related Items
Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three, Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d
Cites Work
- 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
- On Subtournaments of a Tournament
- Tournaments That Admit Exactly One Hamiltonian Circuit
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item