Cycle-factors in oriented graphs

DOI10.1002/JGT.23105MaRDI QIDQ6565819zbMATH OpenFDO

Authors Zhilan Wang, Jin Yan, Jie Zhang

Publication date 2 July 2024

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

Full work available at URL https://doi.org/10.1002/JGT.23105

zbMATH Keywords

cycle-factorminimum semidegreeoriented graph

Mathematics Subject Classification ID

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

Recommendations

• Cycles of given length in oriented graphs
• Short cycles in oriented graphs
• Cyclic triangle factors in regular tournaments
• scientific article; zbMATH DE number 1047732
• Embedding cycles of given length in oriented graphs

Cites work

• A Dirac-Type Result on Hamilton Cycles in Oriented Graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• An exact minimum degree condition for Hamilton cycles in oriented graphs
• Cyclic triangle factors in regular tournaments
• Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
• FF‐factors in Quasi‐random Hypergraphs
• Hamilton Cycles in Oriented Graphs
• scientific article; zbMATH DE number 3632516 (Why is no real title available?)
• scientific article; zbMATH DE number 1047732 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Long Cycles in Digraphs
• Near Perfect Matchings in ${k}$-Uniform Hypergraphs II
• On the maximum number of Hamiltonian paths in tournaments
• Some Theorems on Abstract Graphs
• The complexity of perfect matchings and packings in dense hypergraphs
• Triangle packings and 1-factors in oriented graphs

Cited in

(1)

• A note between transitive C₄-factor and oriented Ramsey number

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565819)