Regular bipartite graphs with all 2-factors isomorphic

摘要

We prove that if G is a k-regular bipartite graph and all 2-factors of G are isomorphic then k less than or equal to 3. (C) 2004 Elsevier Inc. All rights reserved.