Add to ORKGIn this paper, we study the problem of deciding whether the total domination number of a given graph Gcan be reduced using exactly one edge contraction (called1-Edge Contraction(γt)). We focus on several graph classes and determine the computational complexity of this problem. By putting together these results, we manage to obtain a complete complexity dichotomy for H-free graphs
Let d and k be two given integers, and let G be a graph. Can we reduce the independence number of G ...
We study the following problem: for given integers d, k and graph G, can we reduce some fixed graph...
We consider the following problem: can a certain graph parameter of some given graph be reduced by a...
In this work, we study the following problem: given a connected graph G, can we reduce the dominatio...
In this work, we study the following problem: given a connected graph G, can we reduce the dominati...
In this work, we study the following problem: given a connected graph G, can we reduce the dominatio...
In this paper, we consider the following problem: given a connected graph G, can we reduce the domin...
In this paper, we consider the following problem: given a connected graph G, can we reduce the domin...
We consider the problem of reducing the (semi)total domination number of graph by one by contracting...
In this paper we consider the effect of edge contraction on the domination number and total dominati...
In this paper, we study the following problem: given a connected graph G, can we reduce the dominati...
In this paper, we study the following problem: given a connected graph G, can we reduce the dominati...
For a graph parameter π, the Contraction(π) problem consists in, given a graph G and two positive in...
International audienceWe consider the following problem: can a certain graph parameter of some given...
CIAC 2015, Paris, France, May 20-22, 2015We consider the following problem: can a certain graph para...
Let d and k be two given integers, and let G be a graph. Can we reduce the independence number of G ...
We study the following problem: for given integers d, k and graph G, can we reduce some fixed graph...
We consider the following problem: can a certain graph parameter of some given graph be reduced by a...
In this work, we study the following problem: given a connected graph G, can we reduce the dominatio...
In this work, we study the following problem: given a connected graph G, can we reduce the dominati...
In this work, we study the following problem: given a connected graph G, can we reduce the dominatio...
In this paper, we consider the following problem: given a connected graph G, can we reduce the domin...
In this paper, we consider the following problem: given a connected graph G, can we reduce the domin...
We consider the problem of reducing the (semi)total domination number of graph by one by contracting...
In this paper we consider the effect of edge contraction on the domination number and total dominati...
In this paper, we study the following problem: given a connected graph G, can we reduce the dominati...
In this paper, we study the following problem: given a connected graph G, can we reduce the dominati...
For a graph parameter π, the Contraction(π) problem consists in, given a graph G and two positive in...
International audienceWe consider the following problem: can a certain graph parameter of some given...
CIAC 2015, Paris, France, May 20-22, 2015We consider the following problem: can a certain graph para...
Let d and k be two given integers, and let G be a graph. Can we reduce the independence number of G ...
We study the following problem: for given integers d, k and graph G, can we reduce some fixed graph...
We consider the following problem: can a certain graph parameter of some given graph be reduced by a...