Bipartite Graphs: A Functional Approach to Solving the Conundrum

I was recently introduced to a concept in graph theory called bipartite graphs. A bipartite graph is essentially a graph where no node (vertex) has an odd number of hops back to itself (cycles). Wikipedia defines it this way: a graph whose vertices can be divided into two disjoint and independent sets U and V such that every edge connects a vertex in U to one in Essentially, you divide a graph...