Problem #PRU-5249

Problems Graph theory
 10–14  2.0

Problem

A graph is called Bipartite if it is possible to split all its vertices into two groups in such a way that there are no edges connecting vertices from the same group. Find out whic of the following graphs are bipartite and which are not:

image