- #1
Solarmew
- 37
- 1
Suppose G is a HC (Hamiltonian-connected) graph on n >= 4 vertices. Show that connectivity of G is 3.
I tried starting by saying that there would be at least 4C2=6 unique hamiltonian paths. But then I'm not sure where to go from here.
Any hints would be appreciated.
I tried starting by saying that there would be at least 4C2=6 unique hamiltonian paths. But then I'm not sure where to go from here.
Any hints would be appreciated.