scientific article
From MaRDI portal
Publication:3267901
zbMath0092.15801MaRDI QIDQ3267901
Publication date: 1959
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A \(\vec{P_3}\)-decomposition of tournaments and bipartite digraphs, Dicycle cover of Hamiltonian oriented graphs, Vertex 6-pancyclic in-tournaments, On disjoint cycles of the same length in tournaments, The energy of the alphabet model, Parameterized complexity of \(d\)-hitting set with quotas, Hamiltonian dicycles avoiding prescribed arcs in tournaments, Unnamed Item, On pancyclic arcs in hypertournaments, On cycles through a given vertex in multipartite tournaments, An \(s\)-strong tournament with \(s\geq 3\) has \(s+1\) vertices whose out-arcs are 4-pancyclic, Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments, Variations on the Gallai-Milgram theorem, Bypaths in tournaments, Sublinear-Time Algorithms for Tournament Graphs, Trail-connected tournaments, The watchman's walk problem on directed graphs, Notes on weak-odd edge colorings of digraphs, Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths, Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs, Disjoint cycles of different lengths in graphs and digraphs, Cycles through arcs in multipartite tournaments and a conjecture of Volkmann, A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs, Spanning eulerian subdigraphs in semicomplete digraphs, Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments, The iterated local transitivity model for tournaments, Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties, Two‐stage majoritarian choice, Lichiardopol's conjecture on disjoint cycles in tournaments, Complementary cycles of any length in regular bipartite tournaments, Spanning 3-strong tournaments in 5-strong semicomplete digraphs, About the number of oriented Hamiltonian paths and cycles in tournaments, A survey on Hamilton cycles in directed graphs, Regular Hypertournaments and Arc-Pancyclicity, Packing strong subgraph in digraphs, Arc‐disjoint out‐branchings and in‐branchings in semicomplete digraphs, Cycles in bipartite 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, On the spanning connectivity of tournaments, Degrees and cycles in digraphs, On the vertex-pancyclicity of hypertournaments, Cycles of each length in tournaments, Sublinear-time algorithms for tournament graphs, Unnamed Item, On multipartite tournaments, Polynomial stability and potentially stable patterns, Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach, The number of vertices whose out-arcs are pancyclic in a 2-strong tournament, Multipartite tournaments: a survey, Shortcutting directed and undirected networks with a degree constraint, Spannning a strong digraph by \(\alpha\) circuits: a proof of Gallai's conjecture, A linear-time algorithm for finding Hamiltonian cycles in tournaments, On a cyclic connectivity property of directed graphs, A remark on cycles through an arc in strongly connected multipartite tournaments, Cycles in a tournament with pairwise zero, one or two given vertices in common, The structure of 4‐strong tournaments containing exactly three out‐arc pancyclic vertices, Unnamed Item, Cycle factors in strongly connected local tournaments, All 2-connected in-tournaments that are cycle complementary, Hamiltonian tournaments and Gorenstein rings, Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments, Stable set meeting every longest path, Out-arc pancyclicity of vertices in tournaments, Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments, Cycles with a given number of vertices from each partite set in regular multipartite tournaments, Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey, Unnamed Item, A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs, On 1-factors with prescribed lengths in tournaments, On arc-traceable local tournaments, The number of out-pancyclic vertices in a strong tournament, About the number of directed paths in tournaments, Cycles and paths in bipartite tournaments with spanning configurations, Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs, Path Partitions, Cycle Covers and Integer Decomposition, Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente, Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic, Diperfect graphs, Tournaments and Semicomplete Digraphs, Semicomplete Multipartite Digraphs, Arc-pancyclicity of hypertournaments with irregularity at most two, Oriented Hamiltonian cycles in tournaments, Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture, Non-separating spanning trees and out-branchings in digraphs of independence number 2, \(\alpha\)-diperfect digraphs
