Every cycle-connected multipartite tournament with 2 contains at least two universal ARCS

DOI10.1007/S00373-012-1170-2zbMATH Open1268.05094OpenAlexW1995987106MaRDI QIDQ354423FDOQ354423

Authors: Qingsong Zou, Guojun Li, Yunshu 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

Recommendations

• Every cycle-connected multipartite tournament has a universal arc
• scientific article; zbMATH DE number 5994590
• Universal arcs in tournaments
• A remark on cycles through an arc in strongly connected multipartite tournaments
• Cycles through an arc in regular 3-partite tournaments

zbMATH Keywords

universal arccycle-connected digraphsmultipartite tournament

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• On Subtournaments of a Tournament
• Every cycle-connected multipartite tournament has a universal arc
• On a cyclic connectivity property of directed graphs
• On some cyclic connectivity properties of directed graphs (examples and problems)
• Title not available (Why is that?)
• Cycles in multipartite tournaments: Results and problems
• On cycles through a given vertex in multipartite tournaments

Cited In (5)

• Universal arcs in local tournaments
• Universal arcs in tournaments
• Every cycle-connected multipartite tournament has a universal arc
• On disjoint cycles of the same length in tournaments
• On a cyclic connectivity property of directed graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354423)