Disjoint Cycles in a Digraph with Partial Degree
From MaRDI portal
Publication:5883282
DOI10.1137/21M1460594OpenAlexW4321503371MaRDI QIDQ5883282FDOQ5883282
Authors: Hong Wang, Yun Wang, Jin Yan 
Publication date: 30 March 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/21m1460594
Recommendations
- Disjoint directed cycles in directed graphs
- Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
- Disjoint directed cycles with specified lengths in directed bipartite graphs
- scientific article; zbMATH DE number 6890341
- scientific article; zbMATH DE number 825135
Cites Work
- Digraphs
- Cycles through specified vertices
- Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
- Title not available (Why is that?)
- Embedding Arbitrary Graphs of Maximum Degree Two
- Triangle packings and 1-factors in oriented graphs
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
- A sufficient condition for cyclability in directed graphs
- On 2-factors of a bipartite graph
- On the Meyniel condition for Hamiltonicity in bipartite digraphs
- On 2-factors containing 1-factors in bipartite graphs
- Disjoint directed cycles in directed graphs
- On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
- Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
- 2-factors of bipartite graphs with asymmetric minimum degrees
- A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
- New sufficient conditions for bipancyclicity of balanced bipartite digraphs
- On 1-factors with prescribed lengths in tournaments
- Digraphs containing every possible pair of dicycles
Cited In (6)
- Partial degrees on matchings for cycles in bipartite graphs
- On the problem of finding disjoint cycles and dicycles in a digraph
- Partition and disjoint cycles in digraphs
- Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
- Disjoint directed cycles in directed graphs
- Two disjoint cycles in digraphs
This page was built for publication: Disjoint Cycles in a Digraph with Partial Degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883282)
