Maximal Clique and Edge-Ranking Bounds of Biclique Cover Number

Bochuan Lyu, Illya V. Hicks

The biclique cover number $(\text{bc})$ of a graph $G$ denotes the minimum number of complete bipartite (biclique) subgraphs to cover all the edges of the graph. In this paper, we…