scientific article; zbMATH DE number 3013308
From MaRDI portal
Publication:4756732
Recommendations
Cited in
(69)- What must be contained in every oriented k-uniform hypergraph
- Variations on the Gallai-Milgram theorem
- Hamiltonian-connected tournaments
- On the number of Hamiltonian cycles in tournaments
- Paths in r-partite self-complementary graphs
- On the structure of locally semicomplete digraphs
- Hamiltonian arcs in infinite self-complementary graphs
- On avoidable and unavoidable claws
- Pancyclic orderings of in-tournaments
- Antidirected Hamiltonian paths and directed cycles in tournaments
- Stable set meeting every longest path
- Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments
- A short proof of the Chen-Manalastas theorem
- On almost regular tournament matrices
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- On disjoint cycles of the same length in tournaments
- On king-serf pair in tournaments
- Lichiardopol's conjecture on disjoint cycles in tournaments
- \(k\)-ary spanning trees contained in tournaments
- Paths with many shortcuts in tournaments
- Pancyclicity in strong k-quasi-transitive digraphs of large diameter
- Parity of paths in tournaments
- About the number of directed paths in tournaments
- A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs
- On the longest path of a randomly weighted tournament
- Berge's conjecture on directed path partitions -- a survey
- Paths with a given number of vertices from each partite set in regular multipartite tournaments
- On the vertex-pancyclicity of hypertournaments
- Multipartite tournaments: a survey
- Cycles in a tournament with pairwise zero, one or two given vertices in common
- Monochromatic sinks in \(k\)-arc colored tournaments
- Reachability problems in edge-colored digraphs
- A survey on the linear ordering problem for weighted or unweighted tournaments
- A proof of Sumner's universal tournament conjecture for large tournaments
- Basic Terminology, Notation and Results
- Tournaments and Semicomplete Digraphs
- Semicomplete Multipartite Digraphs
- A Ramsey type result for oriented trees
- Cycles with a given number of vertices from each partite set in regular multipartite tournaments
- Weighted maximum-clique transversal sets of graphs
- The watchman's walk problem on directed graphs
- Orientation Ramsey thresholds for cycles and cliques
- Notes on weak-odd edge colorings of digraphs
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs
- On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs
- scientific article; zbMATH DE number 3267979 (Why is no real title available?)
- Trees in tournaments
- On the unavoidability of oriented trees
- On the unavoidability of oriented trees
- Antidirected Hamiltonian paths in tournaments
- Time versus cost tradeoffs for deterministic rendezvous in networks
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
- Spanning eulerian subdigraphs in semicomplete digraphs
- Oriented discrepancy of Hamilton cycles
- Equitable oriented coloring
- About the number of oriented Hamiltonian paths and cycles in tournaments
- An approximate version of Sumner's universal tournament conjecture
- Paths with two blocks in oriented graphs of large minimum semi-degree
- Revisiting the Rédei-Berge symmetric functions via matrix algebra
- Hamiltonian cycles avoiding a spanning forest or a spanning cycle subgraph in tournaments
- Generalized paths and cycles in semicomplete multipartite digraphs
- Oriented Ramsey numbers of some sparse graphs
- A new perspective from hypertournaments to tournaments
- Monochromatic sinks in nearly transitive arc-colored tournaments
- Locally semicomplete multipartite digraphs: a generalization of both locally semicomplete digraphs and semicomplete multipartite digraphs
- The complexity of color-constrained paths in semicomplete multipartite digraphs
- About the number of directed Hamiltonian paths in special tournaments
- On arc-traceable local tournaments
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4756732)
