Hamiltonian‐connected graphs and their strong closures
Pak‐Ken Wong · International Journal of Mathematics and Mathematical Sciences · 1993
Let G be a simple graph of order at least three. We show that G is Hamiltonian‐connected if and only if its strong closure is Hamiltonian‐connected. We also give an efficient algorithm to compute the strong closure of G.