Hamilton cycles in tensor product of graphs

Discrete Mathematics

Volumn 186, Issue 1-3, 1998, Pages 1-13

  Balakrishnan, R ^a   Paulraja, P ^a  

^a ANNAMALAI UNIVERSITY   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037945164     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(97)00215-X     Document Type: Article

References (7)

1. K.A. Berman, Aneulerian digraphs and the determination of those eulerian digraphs having an odd number of defected eulerian paths, Discrete Math. 22 (1978) 75-80.
2. J.A. Bondy and U.S.R. Murty, Graph theory with applications, Macmillan, 1976.
3. H. Fleischner, Eulerian graphs and related topics, Part I, Vol. 1, Ann Discrete Math. 45 (1990).
4. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.
5. P.K. Jha, Hamiltonian Decompositions of products of cycles, Indian J. Pure Appl. Math. 23 (1992) 723-729.
6. P.K. Jha, Decompositions of the Kronecker product of a cycle and a path into long cycles and long paths, Indian J. Pure Appl. Math. 23 (1992) 585-602.
7. Zhon Mingkun, Decomposition of some product graphs into 1-factors and Hamiltonian cycles, Ars Combinatoria 28 (1989) 258-268.