Cycles in multipartite tournaments: Results and problems
From MaRDI portal
Publication:1348110
DOI10.1016/S0012-365X(01)00419-8zbMath0996.05063MaRDI QIDQ1348110
Publication date: 15 May 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items
On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\), Almost regular multipartite tournaments containing a Hamiltonian path through a given arc, Hamiltonian paths containing a given arc, in almost regular bipartite tournaments, On cycles containing a given arc in regular multipartite tournaments, Cycle extendability in extended tournaments, Paths and cycles containing given arcs, in close to regular multipartite tournaments, Longest cycles in almost regular 3-partite tournaments, Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS, Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments, Diregularc-partite tournaments are vertex-pancyclic whenc ? 5, On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\), Complementary cycles in almost regular multipartite tournaments, where one cycle has length four, Weakly cycle complementary 3-partite tournaments, Multipartite tournaments: a survey, Strongly 4-path-connectivity in almost regular multipartite tournaments, Componentwise complementary cycles in multipartite tournaments, Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\), When \(n\)-cycles in \(n\)-partite tournaments are longest cycles, On the connectivity of close to regular multipartite tournaments, The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments, Cycles with a given number of vertices from each partite set in regular multipartite tournaments, On \(n\)-partite tournaments with unique \(n\)-cycle, On cycles in regular 3-partite tournaments, Strong subtournaments containing a given vertex in regular multipartite tournaments, Complementary cycles in irregular multipartite tournaments, Circuits of each length in tournaments, Every cycle-connected multipartite tournament has a universal arc, Complementary cycles in regular multipartite tournaments, where one cycle has length five, Cycles containing a given arc in regular multipartite tournaments, All regular multipartite tournaments that are cycle complementary, Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments, Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs, Semicomplete Multipartite Digraphs, On the vertices of a 3-partite tournament not in triangles
