Biclique partition of the corona and joins of graphs
The article deals with the biclique partition number of a graph. That is the minimal number of complete bipartite subgraphs of a graph needed to partition the edge set of the graph. A lower bound of biclique partition number for joins of graphs and a relationship between the biclique partition numbers of two graphs and the biclique partition number of the corona of these graphs are obtained.