題組內容

七、Graph

(2) Consider the complete bipartite graphK_m,n , where the vertex set is partitioned into two disjoint sets V₁ and V₂with |V₁ | = m and |V₂ | = n. Derive the necessary and sufficient conditions for ? and ? such that K_m，ncontains an Eulerian path but NO Eulerian circuit. (Consider all possible cases for m and n ). (10%)