TU Wien:Diskrete Mathematik für Informatik VU (Gittenberger)/Prüfung 2019-12-13

Beispiel 1:

Exact definition of:

• eulerion circuit
• degree of a vertex
• matching
• connected
• strongly connected
• reduction

Beispiel 2:

Prove: If M = (E,S) is a matroid and A and B are two bases of M, then |A| = |B|.

Beispiel 3:

Show that if G is eulerian that the linegraph of G is eulerian and hamiltonian.

Beispiel 4:

Describe the five color theorem and describe the way how the proof works.