Edge proximity conditions for extendability in cubic bipartite graphs
Robert E. L. Aldred, Bill Jackson · Journal of Graph Theory · 2007
Abstract We show that a set M of m edges in a cyclically (3m − 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