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

DOI10.1007/S00373-012-1170-2MaRDI QIDQ354423zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

universal arccycle-connected digraphsmultipartite tournament

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1817715 (Why is no real title available?)
• scientific article; zbMATH DE number 1498519 (Why is no real title available?)
• Cycles in multipartite tournaments: Results and problems
• Every cycle-connected multipartite tournament has a universal arc
• On Subtournaments of a Tournament
• On a cyclic connectivity property of directed graphs
• On cycles through a given vertex in multipartite tournaments
• On some cyclic connectivity properties of directed graphs (examples and problems)

Cited in

(5)

• On disjoint cycles of the same length in tournaments
• Every cycle-connected multipartite tournament has a universal arc
• Universal arcs in tournaments
• Universal arcs in local 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)