
6.4.3 Graph theory
Problem:
a) Bring an example of an Eulerian graph with an even number of vertices which does not have a perfect matching.
b) Prove that any Hamiltonian graph with an even number of vertices has a perfect matching.