Cycles through a given arc and certain partite sets in almost regular multipartite tournaments

DOI10.1016/J.DISC.2004.02.010zbMath1045.05049OpenAlexW2021512349MaRDI QIDQ1827790

Lutz Volkmann, Stefan Winzen

Publication date: 6 August 2004

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

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

zbMATH Keywords

cyclesmultipartite tournamentsalmost regular multipartite tournaments

Mathematics Subject Classification ID

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

Related Items (2)

Multipartite tournaments: a survey ⋮ The Shifted Turán Sieve Method on Tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
• On Subtournaments of a Tournament
• Cycles of Each Length in Regular Tournaments
• Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic

This page was built for publication: Cycles through a given arc and certain partite sets in almost regular multipartite tournaments