A graph G has the property that every edge of G joins an odd vertex with an even vertex. Show that G is bipartite and has even seize
introduction of graph theory Zhang
A graph G has the property that every edge of G joins an odd vertex with an even vertex. Show that G is bipartite and has even seize
Consider a partition of the vertices into two sets: $\displaystyle \mathcal{E}$ the even vertices and $\displaystyle \mathcal{O}$ the odd vertices.
Now show that produces a bipartite graph.