When is a graph said to be bipartite?

• A. If it can be divided into two independent sets A and B such that each edge connects a vertex from to A to B
• B. If the graph is connected and it has odd number of vertices
• C. If the graph is disconnected
• D. If the graph has at least n/2 vertices whose degree is greater than n/2