On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\)

DOI10.1007/s10255-018-0780-8zbMath1400.05098OpenAlexW2895234386MaRDI QIDQ1617015

Chun-Fang Li, Sheng-Jia Li, Yubao Guo, Qiao-Ping Guo

Publication date: 7 November 2018

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-018-0780-8

zbMATH Keywords

cyclestournamentsmultipartite tournaments

Mathematics Subject Classification ID

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

Cites Work

• Cycles in multipartite tournaments
• Cycles in multipartite tournaments: Results and problems
• Multipartite tournaments: a survey
• On Subtournaments of a Tournament
• Unnamed Item
• Unnamed Item
• Unnamed Item

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