| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331935 | Information Processing Letters | 2005 | 5 Pages |
Abstract
We examine the hamiltonicity of the cartesian product P=G1ÃG2 of two graphs G1, G2. We provide necessary and/or sufficient conditions for P to be hamiltonian, depending on the hamiltonian properties of G1 and G2, with corresponding constructions. We also prove a conjecture by Batagelj and Pisanski related to the 'cyclic hamiltonicity' of a graph.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Vassilios V. Dimakopoulos, Leonidas Palios, Athanasios S. Poulakidas,