Solid Bricks
摘要
The fact that bipartite graphs are free of odd cycles often makes the task of analyzing their properties easier, and makes it possible to state assertions concerning them more simply, and prove them more easily, than the corresponding assertions that are valid for all graphs. For example, the description of the perfect matching polytope of a bipartite graph is simpler, and its proof easier, than the one that applies to all graphs (see Exercise 6.1.1). Solidmatching covered graphs defined below havemany properties akin to those of bipartite matching covered graphs.