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

Graph Square Roots of Small Distance from Degree One Graphs
Given a graph class ℋ, the task of the ℋSquare Root problem is to decid...
read it

Structural Parameterizations of Clique Coloring
A clique coloring of a graph is an assignment of colors to its vertices ...
read it

Reducing graph transversals via edge contractions
For a graph parameter π, the Contraction(π) problem consists in, given a...
read it

bColoring Parameterized by CliqueWidth
We provide a polynomialtime algorithm for bColoring on graphs of const...
read it

Algorithms for the rainbow vertex coloring problem on graph classes
Given a vertexcolored graph, we say a path is a rainbow vertex path if ...
read it

Wellpartitioned chordal graphs: obstruction set and disjoint paths
We introduce a new subclass of chordal graphs that generalizes split gra...
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

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

A Complexity Dichotomy for Critical Values of the bChromatic Number of Graphs
A bcoloring of a graph G is a proper coloring of its vertices such that...
read it

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

Parameterized Aspects of Strong Subgraph Closure
Motivated by the role of triadic closures in social networks, and the im...
read it

Transversals of Longest Paths
Let (G) be the minimum cardinality of a set of vertices that intersects ...
read it
Paloma T. Lima
is this you? claim profile