Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic

DOI10.1016/S0012-365X(01)00212-6zbMath0993.05083MaRDI QIDQ5957756

Anders Yeo, Meike Tewes, Lutz Volkmann

Publication date: 25 September 2002

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

zbMATH Keywords

digraphcyclestournamentspancyclic

Mathematics Subject Classification ID

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

Related Items (14)

Almost regular multipartite tournaments containing a Hamiltonian path through a given arc ⋮ Paths and cycles containing given arcs, in close to regular multipartite tournaments ⋮ Longest cycles in almost regular 3-partite tournaments ⋮ Pancyclic out-arcs of a vertex in oriented graphs ⋮ Multipartite tournaments: a survey ⋮ Strongly 4-path-connectivity in almost regular multipartite tournaments ⋮ Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\) ⋮ On the connectivity of close to regular multipartite tournaments ⋮ Cycles with a given number of vertices from each partite set in regular multipartite tournaments ⋮ Complementary cycles in irregular multipartite tournaments ⋮ Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments ⋮ Cycles through a given arc and certain partite sets in almost regular multipartite tournaments ⋮ Semicomplete Multipartite Digraphs ⋮ On the vertices of a 3-partite tournament not in triangles

This page was built for publication: Almost all almost regular \(c\)-partite tournaments with \(c\geq 5\) are vertex pancyclic