Problem 61
What is a circuit? Describe the difference between a path and a circuit.
Problem 64
A complete graph has 120 distinct Hamilton circuits. How many vertices does the graph have?
Problem 65
How do you determine if a graph has no Euler paths and no Euler circuits?
Problem 66
What is the purpose of Fleury's Algorithm?
Problem 70
Draw a graph with six vertices and two bridges.
Problem 71
I use Fleury's Algorithm to determine if a graph contains Euler paths or Euler circuits.