Disjoint directed cycles

From MaRDI portal
Revision as of 04:06, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1125942

DOI10.1006/jctb.1996.0062zbMath0861.05037OpenAlexW1974181313MaRDI QIDQ1125942

Noga Alon

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 disjoint cycles of the same length in tournamentsMajority colourings of digraphsAn improved bound for disjoint directed cyclesDisjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum DegreeDisjoint cycles of different lengths in graphs and digraphsLichiardopol's conjecture on disjoint cycles in tournamentsTwo disjoint cycles in digraphsDecomposing edge-colored graphs under color degree constraintsOn sufficient conditions for rainbow cycles in edge-colored graphsVertex‐disjoint cycles of the same length in tournamentsDisjoint cycles in tournaments and bipartite tournamentsVertex disjoint 4-cycles in bipartite tournamentsOn Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite GraphsDegree conditions for the existence of vertex-disjoint cycles and paths: a surveyPartition and disjoint cycles in digraphsVertex-disjoint cycles in bipartite tournamentsDisjoint cycles with different length in 4-arc-dominated digraphsDisjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for TournamentsVertex-disjoint rainbow triangles in edge-colored graphsWhat is on his mind?Degree constrained 2-partitions of semicomplete digraphsMajority colorings of sparse digraphsOn the Number of Vertex-Disjoint Cycles in DigraphsSubdivisions in digraphs of large out-degree or large dichromatic numberTournaments and Semicomplete DigraphsBounds on the \(k\)-restricted arc connectivity of some bipartite tournamentsDisjoint cycles in Eulerian digraphs and the diameter of interchange graphs




This page was built for publication: Disjoint directed cycles