The theorems of König and Menger
Many of our graphs in the previous chapters had the property that their point set V(G) decomposed into two disjoint sets X 1 and X 2 and every edge connected one point of X 1 to one of X 2. Such graphs are called bipartite graphs with bipartition X 1, X 2. A simple bipartite graph with bipartition X 1, X 2 where |X 1| = k, |X 2| = ℓ is called a complete bipartite graph and is denoted by K k,ℓ if every point of X 1 is adjacent to every point of X 2. For example, K 3,3 is the second Kuratowski graph.
KeywordsBipartite Graph Perfect Match Polynomial Algorithm Hamiltonian Circuit Forward Edge
Unable to display preview. Download preview PDF.