You must be logged in to see worked solutions.

Already have an account? Log in here.

Any connected group of things can be represented as a graph: cities and roads, people and friendships, and more. Learn why an even number of people have an odd number of friends.

Can you draw a path that visits every node exactly once (i.e. a Hamiltonian path) on the graph above?

You must be logged in to see worked solutions.

Already have an account? Log in here.

You must be logged in to see worked solutions.

Already have an account? Log in here.

How many Hamiltonian paths are there on the graph above?

You must be logged in to see worked solutions.

Already have an account? Log in here.

Does the graph above have a Hamiltonian path?

You must be logged in to see worked solutions.

Already have an account? Log in here.

You must be logged in to see worked solutions.

Already have an account? Log in here.

×

Problem Loading...

Note Loading...

Set Loading...