## Two edge-disjoint Hamiltonian cycles of powers of a graph.(English)Zbl 0583.05040

The main result of the paper is that if G is a connected graph of order $$\geq 5$$, then there exist a hamiltonian cycle C of $$G^ 3$$ and a hamiltonian cycle C’ of $$G^ 5$$ such that C and C’ are edge-disjoint.
Reviewer: F.Tian

### MSC:

 05C45 Eulerian and Hamiltonian graphs 05C38 Paths and cycles

### Keywords:

hamiltonian cycle
Full Text: