What is the simplest method to prove that a graph is bipartite?

• A. It has a cycle of an odd length
• B. It does not have cycles
• C. It does not have a cycle of an odd length
• D. Both odd and even cycles are formed