Graphs: Problem 25 (1 point) Are the following statements true or false?
◻1. Every graph with a Hamilton circuit has a Hamilton path
◻2. If
K_(m,n)has an Euler circuit, then
mand
nare both even.
◻3. If a graph has 7 vertices and every vertex has the same degree, then the graph has an Euler circuit
◻4. Every graph with an Euler circuit has a Hamilton circuit
◻5. Every complete graph has an Euler circuit.