We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Disjoint Cycles of Different Lengths in 3-Regular Digraphs.
- Authors
He, Zhihong; Cheng, Panpan; Gao, Yunshu
- Abstract
In 2012, Henning and Yeo have posed the conjecture that a bipartite 3-regular digraph contains two disjoint cycles of different lengths, and Tan has proved that a 3-regular bipartite digraph, which possesses a cycle factor with at least two cycles, does indeed have two disjoint cycles of different lengths. In this paper, we prove that every 3-regular digraph, which possesses a cycle factor with at least three cycles, contains two disjoint cycles of different lengths, except for the digraph that is isomorphic to the D 2 n 2 ( n ≥ 3 ).
- Publication
Graphs & Combinatorics, 2022, Vol 38, Issue 3, p1
- ISSN
0911-0119
- Publication type
Article
- DOI
10.1007/s00373-022-02465-3