Recent questions tagged hamiltonian-graph

1 votes
2 answers
1
Consider a complete bipartite graph $k_{m,n}$. For which values of $m$ and $n$ does this, complete graph have a Hamilton circuit $m = 3, n = 2$$m = 2, n = 3$ $m = n 2$$m...
To see more, click for the full list of questions or popular tags.