Hamiltonian decomposition of recursive circulant graphs

Discrete Mathematics

Volumn 214, Issue 1-3, 2000, Pages 89-99

  Biss, Daniel K ^a,b  

^a HARVARD UNIVERSITY   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0006897621     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00199-5     Document Type: Article

References (5)

1. B. Alspach, Problems, Discrete Math. 50 (1984) 115.
2. J.C. Bermond, O. Favaron, M. Maheo, Hamiltonian decomposition of Cayley graphs of degree 4, J. Combin. Theory B 46 (1989) 142-153.
3. S.J. Curran, J.A. Gallian, Hamiltonian cycles and paths in Cayley graphs and digraphs - a survey, Discrete Math. 156 (1996) 1-18.
4. C. Micheneau, Disjoint Hamiltonian cycles in recursive circulant graphs, Inform. Process. Lett. 61 (1997) 259-264.
5. J.-H. Park, K.-Y. Chwa, Recursive circulant: a new topology for multicomputer networks, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, ISPAN'94, Japan, IEEE Press, New York, 1994, pp. 73-80.