Disjoint Cycles in a Digraph with Partial Degree

DOI10.1137/21M1460594MaRDI QIDQ5883282zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

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

• scientific article; zbMATH DE number 3149611 (Why is no real title available?)
• 2-factors of bipartite graphs with asymmetric minimum degrees
• A Meyniel-type condition for bipancyclicity in balanced bipartite digraphs
• A sufficient condition for cyclability in directed graphs
• Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
• Cycles through specified vertices
• Digraphs
• Digraphs containing every possible pair of dicycles
• Directed Hamilton cycles in digraphs and matching alternating Hamilton cycles in bipartite graphs
• Disjoint directed cycles in directed graphs
• Embedding Arbitrary Graphs of Maximum Degree Two
• New sufficient conditions for bipancyclicity of balanced bipartite digraphs
• On 1-factors with prescribed lengths in tournaments
• On 2-factors containing 1-factors in bipartite graphs
• On 2-factors of a bipartite graph
• On directed 2-factors in digraphs and 2-factors containing perfect matchings in bipartite graphs
• On the Meyniel condition for Hamiltonicity in bipartite digraphs
• Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths
• Triangle packings and 1-factors in oriented graphs

Cited in

(6)

• Disjoint directed cycles in directed graphs
• Partition and disjoint cycles in digraphs
• Partitioning the vertices of a digraph into directed cycles and degenerated directed cycles
• Two disjoint cycles in digraphs
• On the problem of finding disjoint cycles and dicycles in a digraph
• Partial degrees on matchings for cycles in bipartite graphs

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)