Cycle-factors in oriented graphs

DOI10.1002/jgt.23105zbMATH Open1542.05148MaRDI QIDQ6565819

Jie Zhang, Zhi Lan Wang, Jin Yan

Publication date: 2 July 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

oriented graphminimum semidegreecycle-factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangle packings and 1-factors in oriented graphs
• The complexity of perfect matchings and packings in dense hypergraphs
• Cyclic triangle factors in regular tournaments
• On the maximum number of Hamiltonian paths in tournaments
• Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Long Cycles in Digraphs
• Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
• Hamilton Cycles in Oriented Graphs
• Some Theorems on Abstract Graphs
• F$F$‐factors in Quasi‐random Hypergraphs

This page was built for publication: Cycle-factors in oriented graphs