Complementary cycles in regular multipartite tournaments, where one cycle has length five

DOI10.1016/j.disc.2008.08.022zbMath1229.05170OpenAlexW2078200370MaRDI QIDQ1025933

Stefan Winzen, Dirk Meierling, Torsten Korneffel, Lutz Volkmann, Zhi-hong He

Publication date: 23 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.08.022

zbMATH Keywords

complementary cyclesmultipartite tournamentsregular multipartite tournaments

Mathematics Subject Classification ID

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

Related Items

Complementary cycles in almost regular multipartite tournaments, where one cycle has length four, Weakly cycle complementary 3-partite tournaments, Multipartite tournaments: a survey, Three supplements to Reid's theorem in multipartite tournaments, Complementary cycles in irregular multipartite tournaments

Uses Software

• GAP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complementary cycles of all lengths in tournaments
• Cycles in multipartite tournaments: Results and problems
• Almost regular multipartite tournaments containing a Hamiltonian path through a given arc
• How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
• Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\)
• On the connectivity of close to regular multipartite tournaments
• Diconnected Orientations and a Conjecture of Las Vergnas
• One-diregular subgraphs in semicomplete multipartite digraphs
• Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
• Kings in semicomplete multipartite digraphs
• On Subtournaments of a Tournament