Hamiltonian properties of the cube of a 2‐edge connected graph
M. Paoli · Journal of Graph Theory · 1988
Abstract Let G be a 2‐edge connected graph with at least 5 vertices. For any given vertices a, b, c, and d in G with a ≠ b, there exists in G3 a hamiltonian path with endpoints a and b avoiding the edge cd, and there exists in G3 ∪ {cd} a hamiltonian path with endpoints a and b and containing the edge cd. Also, after removal of two edges or one edge and one vertex from G3, the resulting graph is still hamiltonian.