Publication:4873829

zbMath0840.05026MaRDI QIDQ4873829

Wayne Goddard, Ortrud R. Oellermann

Publication date: 22 April 1996

zbMATH Keywords

cycle; digraph; tournament; strongly connected orientation

Mathematics Subject Classification ID

05C38: Paths and cycles

05C20: Directed graphs (digraphs), tournaments

Related Items

Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs, Weakly quasi-Hamiltonian-set-connected multipartite tournaments, Weakly cycle complementary 3-partite tournaments, The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments, Weakly quasi-Hamiltonian-connected multipartite tournaments, On cycles through a given vertex in multipartite tournaments, The cycle structure of regular multipartite tournaments, Cycles through a given arc and certain partite sets in almost regular multipartite tournaments, On cycles containing a given arc in regular multipartite tournaments, Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs, On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\), Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments, Multipartite tournaments: a survey, On \(n\)-partite tournaments with unique \(n\)-cycle, Semicomplete Multipartite Digraphs, Cycles with a given number of vertices from each partite set in regular multipartite tournaments