Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
From MaRDI portal
Publication:4700528
DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199910)32:2<137::AID-JGT4>3.0.CO;2-I" /><137::AID-JGT4>3.0.CO;2-I 10.1002/(SICI)1097-0118(199910)32:2<137::AID-JGT4>3.0.CO;2-IzbMath0931.05037OpenAlexW4248129877MaRDI QIDQ4700528
Publication date: 16 February 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199910)32:2<137::aid-jgt4>3.0.co;2-i
Related Items (20)
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 ⋮ Vertex-pancyclism in the generalized sum of digraphs ⋮ Complementary cycles of any length in regular bipartite tournaments ⋮ Paths with a given number of vertices from each partite set in regular multipartite tournaments ⋮ Strong subtournaments of order \(c\) containing a given vertex in regular \(c\)-partite tournaments with \(c\geq 16\) ⋮ Pancyclic out-arcs of a vertex in oriented graphs ⋮ Complementary cycles in almost regular multipartite tournaments, where one cycle has length four ⋮ Weakly cycle complementary 3-partite tournaments ⋮ Multipartite tournaments: a survey ⋮ A remark on cycles through an arc in strongly connected multipartite tournaments ⋮ The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments ⋮ 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 ⋮ Complementary cycles in regular multipartite tournaments, where one cycle has length five ⋮ Cycles containing a given arc in regular multipartite tournaments ⋮ Semicomplete Multipartite Digraphs
Cites Work
This page was built for publication: Diregularc-partite tournaments are vertex-pancyclic whenc ? 5
