Protasova, K. D.
(ДЗ "Луганський національний університет імені Тараса Шевченка, 2005)
A finite connected graph G is called square-Hamiltonian if G2 is Hamiltonian. We prove that any join of the family of Hamiltonian graphs by tree is square-Hamiltonian.
Applying this statement we show that the line graph ...