Strong subtournaments containing a given vertex in regular multipartite tournaments

DOI10.1016/J.DISC.2007.10.006zbMath1172.05026OpenAlexW2078497632MaRDI QIDQ998431

Stefan Winzen, Lutz Volkmann

Publication date: 28 January 2009

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

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

zbMATH Keywords

multipartite tournamentsregular multipartite tournamentssubtournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Strong subtournaments and cycles of multipartite tournaments ⋮ Strong subtournaments of order \(c\) containing a given vertex in regular \(c\)-partite tournaments with \(c\geq 16\) ⋮ Multipartite tournaments: a survey

Cites Work

• Cycles in multipartite tournaments: Results and problems
• How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
• Multipartite tournaments: a survey
• Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\)
• Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• Kings in semicomplete multipartite digraphs
• On Subtournaments of a Tournament
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Strong subtournaments containing a given vertex in regular multipartite tournaments