Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS

DOI10.1007/s00373-012-1170-2zbMath1268.05094OpenAlexW1995987106MaRDI QIDQ354423

Qingsong Zou, Guo Jun Li, Yun Shu Gao

Publication date: 19 July 2013

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1170-2

zbMATH Keywords

multipartite tournamentuniversal arccycle-connected digraphs

Mathematics Subject Classification ID

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

Related Items (1)

On disjoint cycles of the same length in tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Every cycle-connected multipartite tournament has a universal arc
• Cycles in multipartite tournaments: Results and problems
• On cycles through a given vertex in multipartite tournaments
• On a cyclic connectivity property of directed graphs
• On Subtournaments of a Tournament

This page was built for publication: Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS