Complementary cycles containing prescribed vertices in tournaments

DOI10.1016/S0012-365X(99)00198-3MaRDI QIDQ1972131zbMATH OpenOpenAlexFDO

Authors Yubao Guo, A. Yeo, Jørgen Bang-Jensen

Publication date 22 June 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(99)00198-3

zbMATH Keywords

cyclestournament

Mathematics Subject Classification ID

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

Review text

Let \(x\) and \(y\) be nodes of a tournament \(T\) with at least eight nodes such that \(T\) remains 2-connected after the arc joining \(x\) and \(y\) is removed. The authors show, among other things, that \(T\) has two node-disjoint cycles \(C_x\) and \(C_y\) containing nodes \(x\) and \(y\), respectively, such that every node of \(T\) belongs either to \(C_x\) or to \(C_y\).

Recommendations

• All 2-connected in-tournaments that are cycle complementary
• scientific article; zbMATH DE number 3914352
• Complementary cycles containing a fixed arc in diregular bipartite tournaments
• scientific article; zbMATH DE number 4127237
• scientific article; zbMATH DE number 398963

Cited in

(6)

• Complementary cycles in regular bipartite tournaments: a proof of Manoussakis, Song and Zhang conjecture
• On 1-factors with prescribed lengths in tournaments
• All 2-connected in-tournaments that are cycle complementary
• Transitive tournaments and self-complementary graphs
• Weakly Complementary Cycles in 3-Connected Multipartite Tournaments
• scientific article; zbMATH DE number 3914352 (Why is no real title available?)

This page was built for publication: Complementary cycles containing prescribed vertices in tournaments

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