scientific article; zbMATH DE number 3013308
From MaRDI portal
Publication:4756732
zbMath0009.14606MaRDI QIDQ4756732
Publication date: 1934
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs ⋮ Pancyclic orderings of in-tournaments ⋮ On disjoint cycles of the same length in tournaments ⋮ What must be contained in every oriented k-uniform hypergraph ⋮ Monochromatic sinks in \(k\)-arc colored tournaments ⋮ Reachability problems in edge-colored digraphs ⋮ A short proof of the Chen-Manalastas theorem ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ A Ramsey type result for oriented trees ⋮ Variations on the Gallai-Milgram theorem ⋮ On the longest path of a randomly weighted tournament ⋮ The watchman's walk problem on directed graphs ⋮ Notes on weak-odd edge colorings of digraphs ⋮ On king-serf pair in tournaments ⋮ 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 ⋮ Lichiardopol's conjecture on disjoint cycles in tournaments ⋮ Hamiltonian-connected tournaments ⋮ About the number of oriented Hamiltonian paths and cycles in tournaments ⋮ On the number of Hamiltonian cycles in tournaments ⋮ Weighted maximum-clique transversal sets of graphs ⋮ Paths in r-partite self-complementary graphs ⋮ \(k\)-ary spanning trees contained in tournaments ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Paths with a given number of vertices from each partite set in regular multipartite tournaments ⋮ Unnamed Item ⋮ On the vertex-pancyclicity of hypertournaments ⋮ An approximate version of Sumner's universal tournament conjecture ⋮ Paths with many shortcuts in tournaments ⋮ On almost regular tournament matrices ⋮ Multipartite tournaments: a survey ⋮ Trees in tournaments ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ Cycles in a tournament with pairwise zero, one or two given vertices in common ⋮ On the structure of locally semicomplete digraphs ⋮ Antidirected Hamiltonian paths and directed cycles in tournaments ⋮ 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 ⋮ Stable set meeting every longest path ⋮ Unnamed Item ⋮ Hamiltonian arcs in infinite self-complementary graphs ⋮ Monochromatic sinks in nearly transitive arc-colored tournaments ⋮ Cycles with a given number of vertices from each partite set in regular multipartite tournaments ⋮ Unnamed Item ⋮ A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs ⋮ On arc-traceable local tournaments ⋮ Time versus cost tradeoffs for deterministic rendezvous in networks ⋮ On the unavoidability of oriented trees ⋮ On the unavoidability of oriented trees ⋮ Parity of paths in tournaments ⋮ About the number of directed paths in tournaments ⋮ Antidirected Hamiltonian paths in tournaments ⋮ Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments ⋮ Basic Terminology, Notation and Results ⋮ Tournaments and Semicomplete Digraphs ⋮ Semicomplete Multipartite Digraphs ⋮ On avoidable and unavoidable claws ⋮ Orientation Ramsey Thresholds for Cycles and Cliques
