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⩽3.

Saved in:
Bibliographic Details
Published in:Journal of combinatorial theory. Series B 2004-09, Vol.92 (1), p.151-161
Main Authors: Aldred, R.E.L., Funk, M., Jackson, Bill, Labbate, D., Sheehan, J.
Format: Article
Language:English
Subjects:
2-Factor hamiltonian
Det-extremal
Isomorphic 2-factors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We prove that if G is a k-regular bipartite graph and all 2-factors of G are isomorphic then k⩽3.
ISSN:0095-8956
1096-0902
DOI:10.1016/j.jctb.2004.05.002