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

DOI10.1007/S10255-018-0780-8MaRDI QIDQ1617015zbMATH OpenOpenAlexFDO

Authors Qiaoping Guo, Yubao Guo, Shengjia Li, Chunfang Li

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

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

Recommendations

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

Cites work

• scientific article; zbMATH DE number 3520431 (Why is no real title available?)
• scientific article; zbMATH DE number 1764950 (Why is no real title available?)
• Cycles in multipartite tournaments
• Cycles in multipartite tournaments: Results and problems
• Multipartite tournaments with small number of cycles
• Multipartite tournaments: a survey
• On Subtournaments of a Tournament

Cited in

(7)

• scientific article; zbMATH DE number 3885940 (Why is no real title available?)
• Strong subtournaments and cycles of multipartite tournaments
• Multipartite tournaments with small number of cycles
• When n-cycles in n-partite tournaments are longest cycles
• On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\)
• On \(n\)-partite tournaments with unique \(n\)-cycle
• Strong subtournaments of order \(c\) containing a given vertex in regular \(c\)-partite tournaments with \(c\geq 16\)

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

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