Question

Let G be a simple connected graph on 6 vertices and 13 edges. Must G have a Hamiltonian circuit? Explain.

Answer 1

A graph with 6 vertices and 13 edges guarantees the graph will be \(K_6\)...

Answer 2

Actually no, we'd be missing one edge.

Answer 3

so no

Answer 4

Hold on, missing *two* edges, not one.

Answer 5

confused?

Answer 6

I'm willing to say yes, but only because I don't see a configuration that isn't Hamiltonian.

Answer 7

based on the 3 principles what would u say?

Answer 8

Our two missing sides:

What three principles?