On cycles through a given vertex in multipartite tournaments

DOI10.1016/S0012-365X(96)00048-9zbMath0883.05087MaRDI QIDQ1356700

Yubao Guo, Lutz Volkmann, Axel Pinkernell

Publication date: 10 June 1997

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

zbMATH Keywords

tournamentlongest cycle

Mathematics Subject Classification ID

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

Related Items (11)

Hamiltonian paths containing a given arc, in almost regular bipartite tournaments ⋮ Longest cycles in almost regular 3-partite tournaments ⋮ Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS ⋮ Multipartite tournaments: a survey ⋮ Componentwise complementary cycles in multipartite tournaments ⋮ Three supplements to Reid's theorem in multipartite tournaments ⋮ When \(n\)-cycles in \(n\)-partite tournaments are longest cycles ⋮ Every cycle-connected multipartite tournament has a universal arc ⋮ Vertex deletion and cycles in multipartite tournaments ⋮ Semicomplete Multipartite Digraphs ⋮ Large degree vertices in longest cycles of graphs II

Cites Work

• On multipartite tournaments
• On cycles in multipartite tournaments
• Cycles in multipartite tournaments
• A complete solution of a problem of Bondy concerning multipartite tournaments
• Long paths and cycles in oriented graphs
• Diconnected Orientations and a Conjecture of Las Vergnas
• Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey
• On Subtournaments of a Tournament
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On cycles through a given vertex in multipartite tournaments