A biclique cover of a graph is a collection of complete
bipartite subgraphs whose union contains every graph
edge of
. The minimum possible size of a biclique
cover of
is the bipartite dimension of
. Requiring each graph edge
to occur exactly once instead gives the biclique
partition number (Pinto 2014).
Biclique Cover
See also
Biclique Partition Number, Bipartite Dimension, Complete Bipartite Graph, Edge CoverExplore with Wolfram|Alpha
References
Fishburn, P. C. and Hammer, P. L. "Bipartite Dimensions and Bipartite Degrees of Graphs." Disc. Math. 160, 127-148, 1996. https://doi.org/10.1016/0012-365X(95)00154-O.Pinto, T. "Biclique Covers and Partitions." Elec. J. Combin. 21, P1.19, 2014. https://doi.org/10.37236/3595.Cite this as:
Weisstein, Eric W. "Biclique Cover." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/BicliqueCover.html