Pages that link to "Item:Q1348110"
From MaRDI portal
The following pages link to Cycles in multipartite tournaments: Results and problems (Q1348110):
Displayed 34 items.
- Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS (Q354423) (← links)
- Componentwise complementary cycles in multipartite tournaments (Q511099) (← links)
- Weakly cycle complementary 3-partite tournaments (Q659739) (← links)
- The number \(\overrightarrow{C_3}\) of -free vertices on 3-partite tournaments (Q708413) (← links)
- Circuits of each length in tournaments (Q742644) (← links)
- Longest cycles in almost regular 3-partite tournaments (Q860458) (← links)
- Strong subtournaments containing a given vertex in regular multipartite tournaments (Q998431) (← links)
- Every cycle-connected multipartite tournament has a universal arc (Q1011750) (← links)
- Complementary cycles in regular multipartite tournaments, where one cycle has length five (Q1025933) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Cycles containing a given arc in regular multipartite tournaments (Q1566067) (← links)
- On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\) (Q1617015) (← links)
- When \(n\)-cycles in \(n\)-partite tournaments are longest cycles (Q1763349) (← links)
- Complementary cycles in irregular multipartite tournaments (Q1793296) (← links)
- All regular multipartite tournaments that are cycle complementary (Q1827717) (← links)
- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments (Q1827718) (← links)
- Almost regular multipartite tournaments containing a Hamiltonian path through a given arc (Q1877670) (← links)
- Hamiltonian paths containing a given arc, in almost regular bipartite tournaments (Q1877685) (← links)
- On cycles containing a given arc in regular multipartite tournaments (Q1887430) (← links)
- Cycle extendability in extended tournaments (Q2149595) (← links)
- On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\) (Q2214307) (← links)
- On the vertices of a 3-partite tournament not in triangles (Q2352064) (← links)
- Paths and cycles containing given arcs, in close to regular multipartite tournaments (Q2384804) (← links)
- Complementary cycles in almost regular multipartite tournaments, where one cycle has length four (Q2446860) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- Strongly 4-path-connectivity in almost regular multipartite tournaments (Q2463909) (← links)
- Almost regular \(c\)-partite tournaments contain a strong subtournament of order \(c\) when \(c\geqslant 5\) (Q2477396) (← links)
- On the connectivity of close to regular multipartite tournaments (Q2492221) (← links)
- On \(n\)-partite tournaments with unique \(n\)-cycle (Q2502031) (← links)
- Semicomplete Multipartite Digraphs (Q3120439) (← links)
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments (Q3599911) (← links)
- Hamilton cycles, avoiding prescribed arcs, in close-to-regular tournaments (Q4700527) (← links)
- Diregularc-partite tournaments are vertex-pancyclic whenc ? 5 (Q4700528) (← links)
- On cycles in regular 3-partite tournaments (Q5920598) (← links)