31. A "'factor graph "'is a bipartite graph representing the factorization of a function. 32. Thus, by sub-additivity, the union of k bipartite graphs cannot have entropy greater than k. 33. The graphs with cochromatic number 2 are exactly the bipartite graphs , complements of bipartite graphs, and split graphs. 34. The graphs with cochromatic number 2 are exactly the bipartite graphs, complements of bipartite graphs , and split graphs. 35. Special cases of the cographs include the complete graphs, complete bipartite graphs , cluster graphs, and threshold graphs. 36. The directors and corporations are listed arbitrarily to begin and the elastic bands placed as edges of the bipartite graph . 37. Since line graphs of bipartite graphs are perfect, the complements of line graphs of bipartite graphs are also perfect. 38. Since line graphs of bipartite graphs are perfect, the complements of line graphs of bipartite graphs are also perfect. 39. An alternative characterization of the bipartite graphs that may be formed by the bipartite double cover construction was obtained by. 40. The algorithm reduces to the standard algorithm for matching in bipartite graphs when " G " is bipartite.
