Finding Biclique Partitions of Co-Chordal Graphs

Bochuan Lyu, Illya V. Hicks

The biclique partition number $(\text{bp})$ of a graph $G$ is referred to as the least number of complete bipartite (biclique) subgraphs that are required to cover the edges of the…