Disjoint directed cycles
From MaRDI portal
Publication:1125942
DOI10.1006/jctb.1996.0062zbMath0861.05037MaRDI QIDQ1125942
Publication date: 8 December 1996
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.0062
Related Items
On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs, On the Number of Vertex-Disjoint Cycles in Digraphs, Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments, Vertex-disjoint cycles in bipartite tournaments, What is on his mind?, An improved bound for disjoint directed cycles, Disjoint cycles of different lengths in graphs and digraphs, Decomposing edge-colored graphs under color degree constraints, Vertex disjoint 4-cycles in bipartite tournaments, Degree conditions for the existence of vertex-disjoint cycles and paths: a survey, Degree constrained 2-partitions of semicomplete digraphs, Disjoint cycles in Eulerian digraphs and the diameter of interchange graphs, Lichiardopol's conjecture on disjoint cycles in tournaments, Subdivisions in digraphs of large out-degree or large dichromatic number, Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments, On sufficient conditions for rainbow cycles in edge-colored graphs, Disjoint cycles with different length in 4-arc-dominated digraphs, Majority colourings of digraphs, Tournaments and Semicomplete Digraphs
