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 - The Fusion of Science and Community**

Dismiss Notice

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

Loading...

Similar Threads - Hamiltonian graph | Date |
---|---|

I Representing Tiling and Packing Solutions | May 26, 2017 |

I Euler's Formula for planar graphs - 1 or 2 ? | May 26, 2016 |

What does it mean? (Graph theory) | Feb 26, 2016 |

Hamiltonian as applied to the grand canonical partition function | Jul 11, 2013 |

**Physics Forums - The Fusion of Science and Community**