Pages that link to "Item:Q4842704"

The following pages link to Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey (Q4842704):

Displaying 34 items.

• Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor (Q393181) (← links)
• The orientation number of two complete graphs with linkages (Q556840) (← links)
• Longest cycles in almost regular 3-partite tournaments (Q860458) (← links)
• Strong subtournaments containing a given vertex in regular multipartite tournaments (Q998431) (← links)
• On a conjecture concerning the orientation number of a graph (Q1024476) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian (Q1356402) (← links)
• The number of kings in a multipartite tournament (Q1356480) (← links)
• On \(k\)-strong and \(k\)-cyclic digraphs (Q1356647) (← links)
• On cycles through a given vertex in multipartite tournaments (Q1356700) (← links)
• Alternating cycles and paths in edge-coloured multigraphs: A survey (Q1356728) (← links)
• Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian (Q1569076) (← links)
• A note on the cardinality of certain classes of unlabeled multipartite tournaments (Q1584288) (← links)
• Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs (Q1584322) (← links)
• The cycle structure of regular multipartite tournaments (Q1613369) (← links)
• Sufficient conditions for Hamiltonian cycles in bipartite digraphs (Q1732099) (← links)
• When \(n\)-cycles in \(n\)-partite tournaments are longest cycles (Q1763349) (← 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)
• Weakly Hamiltonian-connected ordinary multipartite tournaments (Q1842145) (← 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)
• On optimal orientations of Cartesian products with a bipartite graph (Q1961236) (← links)
• Paths and cycles containing given arcs, in close to regular multipartite tournaments (Q2384804) (← links)
• \(k\)-quasi-transitive digraphs of large diameter (Q2413174) (← links)
• Independent sets and non-augmentable paths in generalizations of tournaments (Q2427505) (← links)
• Multipartite tournaments: a survey (Q2463897) (← 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)
• On optimal orientation of cycle vertex multiplications (Q2566147) (← links)
• Cycles with a given number of vertices from each partite set in regular multipartite tournaments (Q3599911) (← links)
• Vertex-disjoint cycles in bipartite tournaments (Q5919730) (← links)