9.7. Exercises
1. Give an optimal assigment to the bipartite weighted graph given by the adjacency matrix

2.
Give a counterexample for the statement, that every even order graph has a
1-factor.
9.7. Exercises
1. Give an optimal assigment to the bipartite weighted graph given by the adjacency matrix