On isomorphic factorizations of circulant graphs
Document Type
Article
Publication Date
9-2006
Department
Department of Mathematical Sciences
Abstract
We investigate the conjecture that every circulant graph X admits a k-isofactorization for every k dividing |E(X)|. We obtain partial results with an emphasis on small values of k.
Publication Title
Journal of Combinatorial Designs
Recommended Citation
Alspach, B.,
Dyer, D.,
&
Kreher, D. L.
(2006).
On isomorphic factorizations of circulant graphs.
Journal of Combinatorial Designs,
14(5), 406-414.
http://doi.org/10.1002/jcd.20080
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/3710
COinS
Publisher's Statement
© 2005 Wiley Periodicals, Inc. Publisher’s version of record: https://doi.org/10.1002/jcd.20080