Key points are not available for this paper at this time.
Abstract We show that a set M of m edges in a cyclically (3 m − 2)‐edge‐connected cubic bipartite graph is contained in a 1‐factor whenever the edges in M are pairwise distance at least f ( m ) apart, where © 2007 Wiley Periodicals, Inc. J Graph Theory 55: 112–120, 2007
Aldred et al. (Mon,) studied this question.