Suppose G is a HC (Hamiltonian-connected) graph on n >= 4 vertices. Show that connectivity of G is 3.(adsbygoogle = window.adsbygoogle || []).push({});

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.

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Hamiltonian graph

**Physics Forums | Science Articles, Homework Help, Discussion**