5 papers
The disjoint separators problem in graphs
Thomas Delépine, Florian Galliot, Yannick Mogge +2
We study the disjoint separators problem in graphs, an analogue of the famous disjoint paths problem. Given a graph and four pairwise disjoint subsets of vertices , ,…
Vertex removal in biclique graphs
Leandro Montero
A \textit{biclique} is a maximal induced complete bipartite subgraph. The \textit{biclique graph} of a graph , denoted by , is the intersection graph of the family of all…
On the edge-biclique graph and the iterated edge-biclique operator
Leandro Montero, Sylvain Legay
A biclique of a graph is a maximal induced complete bipartite subgraph of . The edge-biclique graph of , , is the edge-intersection graph of the bicliques of …
Structural properties of biclique graphs and the distance formula
Marina Groshaus, Leandro Montero
A \textit{biclique} is a maximal induced complete bipartite subgraph of . The \textit{biclique graph} of a graph , denoted by , is the intersection graph of the family…
Tight lower bounds on the number of bicliques in false-twin-free graphs
Marina Groshaus, Leandro Montero
A \emph{biclique} is a maximal bipartite complete induced subgraph of . Bicliques have been studied in the last years motivated by the large number of applications. In particula…