Disjoint cycles in digraphs
From MaRDI portal
Cites work
- Cycles in digraphs– a survey
- Disjoint cycles in digraphs
- Girth in graphs
- scientific article; zbMATH DE number 3933112 (Why is no real title available?)
- On Independent Circuits Contained in a Graph
- On the maximal number of independent circuits in a graph
- On the maximal number of independent circuits in a graph
- The directed subgraph homeomorphism problem
Cited in
(54)- The 2-linkage problem for acyclic digraphs
- The Gallai-Younger conjecture for planar graphs
- An improved bound for disjoint directed cycles
- Not-all-equal 3-SAT and 2-colorings of 4-regular 4-uniform hypergraphs
- Disjoint cycles of different lengths in graphs and digraphs
- Vertex disjoint 4-cycles in bipartite tournaments
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- On the number of disjoint 4-cycles in regular tournaments
- On splitting digraphs
- Degree constrained 2-partitions of semicomplete digraphs
- Group weighted matchings in bipartite graphs
- Nearly sign-nonsingular matrices
- Vertex-disjoint cycles in local tournaments
- An improvement of Lichiardopol's theorem on disjoint cycles in tournaments
- Properly colored short cycles in edge-colored graphs
- Disjoint properly colored cycles in edge-colored complete bipartite graphs
- 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
- Lichiardopol's conjecture on disjoint cycles in tournaments
- On 3-regular digraphs of girth 4
- Bounds on the \(k\)-restricted arc connectivity of some bipartite tournaments
- On the problem of finding disjoint cycles and dicycles in a digraph
- Disjoint cycles with different length in 4-arc-dominated digraphs
- Partition and disjoint cycles in digraphs
- Arc-disjoint directed and undirected cycles in digraphs
- On 2-colorings of hypergraphs
- Tournaments and Semicomplete Digraphs
- On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
- Disjoint Cycles with Length Constraints in Digraphs of Large Connectivity or Large Minimum Degree
- On the number of vertex-disjoint cycles in digraphs
- A relaxed version of the Erdős-Lovász Tihany conjecture
- Disjoint 3-cycles in tournaments: a proof of the Bermond-Thomassen conjecture for tournaments
- Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths
- Vertex-disjoint cycles in bipartite tournaments
- Vertex-disjoint cycles in bipartite tournaments
- Disjoint cycles in digraphs
- Properly colored cycles of different lengths in edge-colored complete graphs
- Two disjoint cycles in digraphs
- 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
- Note on disjoint cycles in multipartite tournaments
- Robust economic models
- On partitions of edge-colored graphs under color degree constraints
- Incomplete tournaments without disjoint cycles of different lengths
- A note on digraph splitting
- Strong k-transitive oriented graphs with large minimum degree
- Extremal results on disjoint cycles in tournaments and bipartite tournaments
- Oriented cycles in digraphs of large outdegree
- A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths
- What is on his mind?
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
- The Hoàng-Reed conjecture for \(\delta ^{+}=3\)
This page was built for publication: Disjoint cycles in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q595675)
