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

tournament; longest cycle

Mathematics Subject Classification ID

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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