Cycles with a given number of vertices from each partite set in regular multipartite tournaments

DOI10.1007/s10587-006-0059-8zbMath1164.05398OpenAlexW2052273066MaRDI QIDQ3599911

Stefan Winzen, Lutz Volkmann

Publication date: 9 February 2009

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/31070

zbMATH Keywords

cyclesmultipartite tournamentsregular multipartite tournaments

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (2)

Paths with a given number of vertices from each partite set in regular multipartite tournaments ⋮ Multipartite tournaments: a survey

Cites Work

• Cycles in bipartite tournaments
• Cycles in multipartite tournaments: Results and problems
• All regular multipartite tournaments that are cycle complementary
• 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\)
• Diconnected Orientations and a Conjecture of Las Vergnas
• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
• One-diregular subgraphs in semicomplete multipartite digraphs
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• On Subtournaments of a Tournament
• Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycles with a given number of vertices from each partite set in regular multipartite tournaments