Graph Theory

Hamiltonian and Euler cycles must have verticies of ___ degree.

What is the name for a cycle that passes through each vertex only once, except for the starting and ending points?

What is the name for a cycle that passes through each edge only once, except for the starting and ending points?

In Euler and Hamiltonian cycles, you must touch all the ___ in the graphs.

Can you find an Euler cycle in the following graph?

Are the graphs isomorphic?

Are the graphs isomorphic?

Are the graphs isomorphic?

What is the ONE difference between a Hamiltonian cycle and the TSP?

Give (if any) a possible Hamiltonian cycle in the graph.