Thread: Graph theory, bipartite Graph

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

2

Originally Posted by Amer

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: the even vertices and the odd vertices.
Now show that produces a bipartite graph.