Partition and disjoint cycles in digraphs
From MaRDI portal
Publication:2698538
DOI10.1007/S00373-023-02631-1OpenAlexW4360980392MaRDI QIDQ2698538FDOQ2698538
Publication date: 24 April 2023
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-023-02631-1
Recommendations
Cites Work
- Digraphs
- Title not available (Why is that?)
- Graph colouring and the probabilistic method
- Splitting digraphs
- Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz
- Title not available (Why is that?)
- Cycles in digraphs– a survey
- A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs
- Disjoint cycles in digraphs
- Disjoint directed cycles
- On the Number of Vertex-Disjoint Cycles in Digraphs
- Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles
- On splitting digraphs
- An improved bound for disjoint directed cycles
- Disjoint cycles of different lengths in graphs and digraphs
- Vertex disjoint cycles of different length in digraphs
Cited In (7)
- 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
- Two disjoint cycles in digraphs
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)
