5 citations · 5 across the 8 of their papers we have counts for
1 paper · 1 filter
Erik Carlson, Willem Fletcher, MurphyKate Montee +3
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We constr…