The square of every nonseparable graph is Hamiltonian
From MaRDI portal
Publication:5628164
DOI10.1090/S0002-9904-1971-12860-4zbMath0223.05124MaRDI QIDQ5628164
Publication date: 1971
Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)
Related Items
Tough graphs and Hamiltonian circuits. (Reprint) ⋮ Graphs with 1-hamiltonian-connected cubes ⋮ Tough graphs and Hamiltonian circuits.