Every cycle-connected multipartite tournament has a universal arc

DOI10.1016/j.disc.2008.01.032zbMath1161.05041OpenAlexW2043647572MaRDI QIDQ1011750

Stefan Winzen, Lutz Volkmann

Publication date: 9 April 2009

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

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

zbMATH Keywords

multipartite tournamentuniversal arcc-partite tournamentcycle connected bipartite tournamentcycle connected multipartite tournamentcycle-connected digraph

Mathematics Subject Classification ID

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

Related Items (3)

Universal arcs in tournaments ⋮ Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS ⋮ Universal arcs in local tournaments

Cites Work

• Unnamed Item
• Cycles in multipartite tournaments: Results and problems
• On cycles through a given vertex in multipartite tournaments
• On a cyclic connectivity property of directed graphs
• Long paths and cycles in oriented graphs
• Diconnected Orientations and a Conjecture of Las Vergnas

This page was built for publication: Every cycle-connected multipartite tournament has a universal arc