On a Hamiltonian cycle of the fourth power of a connected graph. (English) Zbl 0752.05039

Author’s summary: In this paper the following theorem is proved: Let \(G\) be a connected graph of order \(p\geq 4\) and let \(M\) be a matching in \(G\). Then there exists a Hamiltonian cycle \(C\) of \(G^ 4\) such that \(E(C)\cap M=\emptyset\).
Reviewer: F.Tian (Beijing)


05C45 Eulerian and Hamiltonian graphs
05C38 Paths and cycles
05C75 Structural characterization of families of graphs
Full Text: EuDML