research
∙
04/03/2023
Dichotomies for Maximum Matching Cut: H-Freeness, Bounded Diameter, Bounded Radius
The (Perfect) Matching Cut problem is to decide if a graph G has a (perf...
share
research
∙
12/23/2022
Matching Cuts in Graphs of High Girth and H-Free Graphs
The (Perfect) Matching Cut is to decide if a graph has a (perfect) match...
research
∙
07/14/2022
Finding Matching Cuts in H-Free Graphs
The NP-complete problem Matching Cut is to decide if a graph has a match...
research
∙
06/29/2022
Finding k-community structures in special graph classes
For a fixed integer k≥ 2, a k-community structure in an undirected graph...
research
∙
04/14/2022
On The Complexity of Matching Cut for Graphs of Bounded Radius and H-Free Graphs
For a connected graph G=(V,E), a matching M⊆ E is a matching cut of G if...
research
∙
03/06/2022
Locally checkable problems parameterized by clique-width
We continue the study initiated by Bonomo-Braberman and Gonzalez in 2020...
research
∙
07/08/2021
Using edge contractions to reduce the semitotal domination number
In this paper, we consider the problem of reducing the semitotal dominat...
research
∙
10/27/2020
Reducing the domination number of P_3+kP_2-free graphs via one edge contraction
In this note, we consider the following problem: given a connected graph...
research
∙
09/18/2020
Blocking total dominating sets via edge contractions
In this paper, we study the problem of deciding whether the total domina...
research
∙
06/28/2019
Blocking dominating sets for H-free graphs via edge contractions
In this paper, we consider the following problem: given a connected grap...
research
∙
03/05/2019
CPG graphs: Some structural and hardness results
In this paper we continue the systematic study of Contact graphs of Path...
research
∙
03/05/2019
Reducing the domination number of graphs via edge contractions
In this paper, we study the following problem: given a connected graph G...
research
∙
01/07/2019
On the Parameterized Complexity of k-Edge Colouring
For every fixed integer k ≥ 1, we prove that k-Edge Colouring is fixed-p...
research
∙
10/18/2018
Planar CPG graphs
We show that for any k ≥ 0, there exists a planar graph which is B_k+1-C...
research
∙
10/16/2018
Semitotal Domination: New hardness results and a polynomial-time algorithm for graphs of bounded mim-width
A semitotal dominating set of a graph G with no isolated vertex is a dom...
research
∙
10/10/2018
Classifying k-Edge Colouring for H-free Graphs
A graph is H-free if it does not contain an induced subgraph isomorphic ...
research
∙
08/30/2018
Maximum Eccentric Connectivity Index for Graphs with Given Diameter
The eccentricity of a vertex v in a graph G is the maximum distance betw...
research
∙
08/28/2018
Proper circular arc graphs as intersection graphs of paths on a grid
In this paper we present a characterisation, by an infinite family of mi...
research
∙
08/24/2018
Detecting strong cliques
A strong clique in a graph is a clique intersecting every maximal indepe...
research
∙
07/19/2018
On some special classes of contact B_0-VPG graphs
A graph G is a B_0-VPG graph if one can associate a path on a rectangula...
research
∙
03/09/2018