On the edge-biclique graph and the iterated edge-biclique operator

Leandro Montero, Sylvain Legay

A biclique of a graph $G$ is a maximal induced complete bipartite subgraph of $G$. The edge-biclique graph of $G$, $K{B}_e(G)$, is the edge-intersection graph of the bicliques of $G$…