TU Wien:Diskrete Mathematik für Informatik UE (Gittenberger)/Übungen WS13/Beispiel 32

For which $m$ and $n$ does the complete bipartite graph $K_{m,n}$ have a Hamiltonian cycle?

Solution

See Homework 13 Solutions (Page 6)

Materialien

Neues Material hinzufügen

E

• Exercise 32.pdf (details)