The following pages link to (Q4756732):
Displaying 50 items.
- A Ramsey type result for oriented trees (Q338566) (← links)
- Weighted maximum-clique transversal sets of graphs (Q410660) (← links)
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs (Q539864) (← links)
- An approximate version of Sumner's universal tournament conjecture (Q651033) (← links)
- Monochromatic sinks in nearly transitive arc-colored tournaments (Q709318) (← links)
- On arc-traceable local tournaments (Q998389) (← links)
- What must be contained in every oriented k-uniform hypergraph (Q1092925) (← links)
- Variations on the Gallai-Milgram theorem (Q1112833) (← links)
- Hamiltonian-connected tournaments (Q1140091) (← links)
- On the number of Hamiltonian cycles in tournaments (Q1142228) (← links)
- Paths in r-partite self-complementary graphs (Q1148330) (← links)
- On the structure of locally semicomplete digraphs (Q1198647) (← links)
- Hamiltonian arcs in infinite self-complementary graphs (Q1220086) (← links)
- On avoidable and unavoidable claws (Q1584226) (← links)
- Pancyclic orderings of in-tournaments (Q1613377) (← links)
- Antidirected Hamiltonian paths and directed cycles in tournaments (Q1752677) (← links)
- Stable set meeting every longest path (Q1763350) (← links)
- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments (Q1827718) (← links)
- A short proof of the Chen-Manalastas theorem (Q1903737) (← links)
- On almost regular tournament matrices (Q1971038) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- On disjoint cycles of the same length in tournaments (Q2125644) (← links)
- On king-serf pair in tournaments (Q2182214) (← links)
- Lichiardopol's conjecture on disjoint cycles in tournaments (Q2188844) (← links)
- \(k\)-ary spanning trees contained in tournaments (Q2197413) (← links)
- Paths with many shortcuts in tournaments (Q2219961) (← links)
- Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter (Q2243313) (← links)
- Parity of paths in tournaments (Q2297716) (← links)
- About the number of directed paths in tournaments (Q2306588) (← links)
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs (Q2357785) (← links)
- On the longest path of a randomly weighted tournament (Q2399297) (← links)
- Berge's conjecture on directed path partitions -- a survey (Q2433711) (← links)
- Paths with a given number of vertices from each partite set in regular multipartite tournaments (Q2433729) (← links)
- On the vertex-pancyclicity of hypertournaments (Q2444569) (← links)
- Multipartite tournaments: a survey (Q2463897) (← links)
- Cycles in a tournament with pairwise zero, one or two given vertices in common (Q2470442) (← links)
- Monochromatic sinks in \(k\)-arc colored tournaments (Q2631072) (← links)
- Reachability problems in edge-colored digraphs (Q2643322) (← links)
- A survey on the linear ordering problem for weighted or unweighted tournaments (Q2644372) (← links)
- A proof of Sumner's universal tournament conjecture for large tournaments (Q2857428) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Semicomplete Multipartite Digraphs (Q3120439) (← links)
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments (Q3599911) (← links)
- The watchman's walk problem on directed graphs (Q5000299) (← links)
- Orientation Ramsey Thresholds for Cycles and Cliques (Q5013576) (← links)
- Notes on weak-odd edge colorings of digraphs (Q5090189) (← links)
- (Q5092387) (← links)
- (Q5554170) (← links)
