4 citations · 8 across the 4 of their papers we have counts for
7 papers
Biclique Graphs of -free Graphs and Bipartite Graphs
Marina Groshaus, André Luiz Pires Guedes
A biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph , , defined as the intersection graph of the bicliques of , was introduce…
Intersection graph of maximal stars
Guilherme C. M. Gomes, Marina Groshaus, Carlos V. G. C. Lima +1
A biclique of a graph is an induced complete bipartite subgraph of such that neither part is empty. A star is a biclique of such that one part has exactly one vertex. T…
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…
Almost every graph is divergent under the biclique operator
Marina Groshaus, André Guedes, Leandro Montero
A biclique of a graph is a maximal induced complete bipartite subgraph of . The biclique graph of denoted by , is the intersection graph of all the bicliques of $…
Proper Hamiltonian Paths in Edge-Coloured Multigraphs
Raquel Águeda, Valentin Borozan, Marina Groshaus +3
Given a -edge-coloured multigraph, a proper Hamiltonian path is a path that contains all the vertices of the multigraph such that no two adjacent edges have the same colour. In…
On edge-sets of bicliques in graphs
Marina Groshaus, Pavol Hell, Juraj Stacho
A biclique is a maximal induced complete bipartite subgraph of a graph. We investigate the intersection structure of edge-sets of bicliques in a graph. Specifically, we study the a…