6. A simple graph *G* is bipartite if *V* can be partitioned into two disjoint subsets *V_{1}* and *V_{2}* such that every edge connects a vertex in *V_{1}* and a vertex in *V_{2}*.
(A)O
(B)X

相關試題

相關試卷