|
|||||
|
|
On isomorphic factorizations of circulant graphs |
|
| Authors: | Brian Alspach Danny Dyer Donald L Kreher |
| 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. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006 |
| Keywords: | circulant graph isomorphic factorization k‐isofactorization |