Title

On isomorphic factorizations of circulant graphs

Document Type

Article

Publication Date

9-1-2006

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. © 2005 Wiley Periodicals, Inc.

Publication Title

Journal of Combinatorial Designs

Share

COinS