Disjoint Cycles in a Digraph with Partial Degree

DOI10.1137/21M1460594OpenAlexW4321503371MaRDI QIDQ5883282

Yun Wang, Jin Yan, Hong Wang

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

zbMATH Keywords

cyclablepartial degree\(M\)-alternating cyclesAigner-Brandt theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Cycles through specified vertices
• A sufficient condition for cyclability in directed graphs
• Triangle packings and 1-factors in oriented graphs
• Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
• On 2-factors containing 1-factors in bipartite graphs
• Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
• New sufficient conditions for bipancyclicity of balanced bipartite digraphs
• Disjoint directed cycles in directed graphs
• On 1-factors with prescribed lengths in tournaments
• A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
• On 2-factors of a bipartite graph
• Embedding Arbitrary Graphs of Maximum Degree Two
• Digraphs containing every possible pair of dicycles
• On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs
• On the Meyniel condition for hamiltonicity in bipartite digraphs
• Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs
• 2-Factors of Bipartite Graphs with Asymmetric Minimum Degrees
• Digraphs

This page was built for publication: Disjoint Cycles in a Digraph with Partial Degree