Recommendations
Cites work
- scientific article; zbMATH DE number 944226 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- A step toward the Bermond-Thomassen conjecture about disjoint cycles in digraphs
- An improved bound for disjoint directed cycles
- Cycles in digraphs– a survey
- Digraphs
- Disjoint cycles in digraphs
- Disjoint cycles of different lengths in graphs and digraphs
- Disjoint directed cycles
- Graph colouring and the probabilistic method
- On splitting digraphs
- On the number of vertex-disjoint cycles in digraphs
- Proof of a conjecture of Henning and yeo on vertex-disjoint directed cycles
- Splitting digraphs
- Vertex disjoint cycles of different length in digraphs
- Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz
Cited in
(7)- Two disjoint cycles in digraphs
- Cycle partitions of regular graphs
- On the problem of finding disjoint cycles and dicycles in a digraph
- A note on a cycle partition problem
- Partitioning digraphs with outdegree at least 4
- Partitions of digraphs into paths or circuits
- Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
This page was built for publication: Partition and disjoint cycles in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2698538)
