On the n-partite tournaments with exactly n - m + 1 cycles of length m
From MaRDI portal
Publication:2214307
Recommendations
Cites work
- Cycles in multipartite tournaments
- Cycles in multipartite tournaments: Results and problems
- Hamiltonian tournaments with the least number of 3-cycles
- scientific article; zbMATH DE number 3520431 (Why is no real title available?)
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- scientific article; zbMATH DE number 2104714 (Why is no real title available?)
- scientific article; zbMATH DE number 867712 (Why is no real title available?)
- Multipartite tournaments with small number of cycles
- On \(n\)-partite tournaments with unique \(n\)-cycle
- On Subtournaments of a Tournament
- Tournaments That Admit Exactly One Hamiltonian Circuit
Cited in
(6)- On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)
- When n-cycles in n-partite tournaments are longest cycles
- A complete solution of a problem of Bondy concerning multipartite tournaments
- On \(n\)-partite tournaments with unique \(n\)-cycle
- Multipartite tournaments with small number of cycles
- A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles
This page was built for publication: On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214307)