On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\)

DOI10.7151/dmgt.2167zbMath1453.05040OpenAlexW2896760099MaRDI QIDQ2214307

Wei Meng, Qiao-Ping Guo

Publication date: 8 December 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2167

zbMATH Keywords

cyclestournamentsmultipartite tournaments

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cycles in multipartite tournaments
• Cycles in multipartite tournaments: Results and problems
• On \(n\)-partite tournaments with unique \(n\)-cycle
• Hamiltonian tournaments with the least number of 3-cycles
• On Subtournaments of a Tournament
• Tournaments That Admit Exactly One Hamiltonian Circuit

This page was built for publication: On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\)