
Using edge contractions to reduce the semitotal domination number
In this paper, we consider the problem of reducing the semitotal dominat...
read it

Reducing the domination number of P_3+kP_2free graphs via one edge contraction
In this note, we consider the following problem: given a connected graph...
read it

Blocking total dominating sets via edge contractions
In this paper, we study the problem of deciding whether the total domina...
read it

Approximating Independent Set and Dominating Set on VPG graphs
We consider Independent Set and Dominating Set restricted to VPG graphs ...
read it

Characterising circulararc contact B_0VPG graphs
A contact B_0VPG graph is a graph for which there exists a collection o...
read it

Blocking dominating sets for Hfree graphs via edge contractions
In this paper, we consider the following problem: given a connected grap...
read it

CPG graphs: Some structural and hardness results
In this paper we continue the systematic study of Contact graphs of Path...
read it

Reducing the domination number of graphs via edge contractions
In this paper, we study the following problem: given a connected graph G...
read it

On the Parameterized Complexity of kEdge Colouring
For every fixed integer k ≥ 1, we prove that kEdge Colouring is fixedp...
read it

Planar CPG graphs
We show that for any k ≥ 0, there exists a planar graph which is B_k+1C...
read it

Semitotal Domination: New hardness results and a polynomialtime algorithm for graphs of bounded mimwidth
A semitotal dominating set of a graph G with no isolated vertex is a dom...
read it

Classifying kEdge Colouring for Hfree Graphs
A graph is Hfree if it does not contain an induced subgraph isomorphic ...
read it

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...
read it

On contact graphs of paths on a grid
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs)...
read it
Esther Galby
is this you? claim profile