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

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