On \(n\)-partite tournaments with unique \(n\)-cycle
From MaRDI portal
Publication:2502031
DOI10.1007/s00373-006-0641-8zbMath1100.05044MaRDI QIDQ2502031
Gregory Gutin, Anders Yeo, Arash Rafiey
Publication date: 12 September 2006
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-006-0641-8
Related Items
The Shifted Turán Sieve Method on Tournaments, On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\), Multipartite tournaments: a survey, Semicomplete Multipartite Digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycles in multipartite tournaments
- Cycles in multipartite tournaments: Results and problems
- A note on the cardinality of certain classes of unlabeled multipartite tournaments
- On enumerating tournaments that admit exactly one Hamiltonian circuit
- The number of tournaments with a unique spanning cycle
- Diconnected Orientations and a Conjecture of Las Vergnas
- Generalizations of tournaments: A survey
- Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
- Tournaments That Admit Exactly One Hamiltonian Circuit