2 citations · 6 across the 7 of their papers we have counts for
10 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…
Tropical Dominating Sets in Vertex-Coloured Graphs
J. -A. Angles d'Auriac, Cs. Bujtas, A. El Maftouhi +7
Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating set…
Proper Hamiltonian Cycles in Edge-Colored Multigraphs
Raquel Águeda, Valentin Borozan, Raquel Díaz +2
A -edge-colored multigraph has each edge colored with one of the available colors and no two parallel edges have the same color. A proper Hamiltonian cycle is a cycle contai…
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…
Further results on strong edge-colourings in outerplanar graphs
Valentin Borozan, Leandro Montero, Narayanan Narayanan
An edge-colouring is {\em strong} if every colour class is an induced matching. In this work we give a formulae that determines either the optimal or the optimal plus one strong ch…