Q23,paper2,J14. Consider a complete bipartite graph km,n . For which values of m and n does this, complete graph have a Hamilton circuit

(A) m = 3, n = 2

 (B) m = 2, n = 3

(C) m = n >=2

(D) m = n >=3

Answer C.

(Km,n has a Hamilton circuit if and only if m=n>=2 ) or (Km,n has a Hamilton path if and only if m=n+1 or n=m+1)