scientific article; zbMATH DE number 867712

zbMath0840.05026MaRDI QIDQ4873829

Wayne Goddard, Ortrud R. Oellermann

Publication date: 22 April 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cycledigraphtournamentstrongly connected orientation

Mathematics Subject Classification ID

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

Related Items (16)

The cycle structure of regular multipartite tournaments ⋮ On cycles containing a given arc in regular multipartite tournaments ⋮ Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs ⋮ On cycles through a given vertex in multipartite tournaments ⋮ Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs ⋮ Weakly quasi-Hamiltonian-connected multipartite tournaments ⋮ Weakly quasi-Hamiltonian-set-connected multipartite tournaments ⋮ On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\) ⋮ Weakly cycle complementary 3-partite tournaments ⋮ Multipartite tournaments: a survey ⋮ 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 ⋮ Cycles through a given arc and certain partite sets in almost regular multipartite tournaments ⋮ Semicomplete Multipartite Digraphs ⋮ Quasi-Hamiltonian cycles in \(k\)-strong multipartite tournaments

This page was built for publication: