2-Factors of cubic bipartite graphs

For a positive integer k >= 3, a {C-n : n >= k}-factor in a graph G is a spanning subgraph of G in which each component is a cycle of length at least k. Kano, Lee and Suzuki proved that every bipartite cubic graph contains a {C-n : n >= 6}-factor. In this paper, we prove that every bipartite cubic graph G contains a {C-n : n >= 8}-factor, provided that G satisfies some conditions related to 6-cycles. (C) 2021 Published by Elsevier B.V.