Multipartite tournaments with small number of cycles

zbMATH Open1101.05037MaRDI QIDQ5487898FDOQ5487898

Authors: G. Gutin, Arash Rafiey 

Publication date: 13 September 2006

Recommendations

• On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\)
• On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)
• scientific article; zbMATH DE number 867712
• On cycles in multipartite tournaments
• Cycles in multipartite tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Cited In (8)

• Title not available (Why is that?)
• A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles
• Multipartite tournaments: a survey
• On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\)
• On \(n\)-partite tournaments with unique \(n\)-cycle
• On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Multipartite tournaments with small number of cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5487898)