Disjoint cycles in digraphs
From MaRDI portal
Publication:595675
DOI10.1007/BF02579195zbMath0527.05036MaRDI QIDQ595675
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)
Related Items
Vertex-disjoint cycles of different lengths in multipartite tournaments, On disjoint cycles of the same length in tournaments, Vertex-disjoint rainbow cycles in edge-colored graphs, An improved bound for disjoint directed cycles, Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs, Nearly sign-nonsingular matrices, Disjoint cycles in digraphs, The Gallai-Younger conjecture for planar graphs, Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree, On 2-Colorings of Hypergraphs, Disjoint cycles of different lengths in graphs and digraphs, Properly colored cycles of different lengths in edge-colored complete graphs, Lichiardopol's conjecture on disjoint cycles in tournaments, Two disjoint cycles in digraphs, Decomposing edge-colored graphs under color degree constraints, Vertex‐disjoint cycles of the same length in tournaments, Vertex-disjoint cycles of different lengths in local tournaments, Disjoint cycles in tournaments and bipartite tournaments, On the problem of finding disjoint cycles and dicycles in a digraph, Vertex disjoint 4-cycles in bipartite tournaments, On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Partition and disjoint cycles in digraphs, On the number of disjoint 4-cycles in regular tournaments, Vertex-disjoint cycles in bipartite tournaments, Disjoint cycles with different length in 4-arc-dominated digraphs, Robust economic models, On splitting digraphs, Vertex-disjoint cycles in bipartite tournaments, Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree, Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments, Vertex-disjoint cycles in local tournaments, An improvement of Lichiardopol's theorem on disjoint cycles in tournaments, The Hoàng-Reed conjecture for \(\delta ^{+}=3\), What is on his mind?, Degree constrained 2-partitions of semicomplete digraphs, On 3-regular digraphs of girth 4, On the Number of Vertex-Disjoint Cycles in Digraphs, Group weighted matchings in bipartite graphs, Properly colored short cycles in edge-colored graphs, Arc-Disjoint Directed and Undirected Cycles in Digraphs, Tournaments and Semicomplete Digraphs, Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments, Disjoint properly colored cycles in edge-colored complete bipartite graphs, Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths, The 2-linkage problem for acyclic digraphs, A Relaxed Version of the Erdős–Lovász Tihany Conjecture
Cites Work
