论文部分内容阅读
Abstract: A bipartite decomposition of a graph G is a partition π of E(G) intodisjoint sets E(HI) such that each of subgraphs Hi induced by E(HI) is a