Structural graph parameters, such as treewidth, pathwidth, and clique-width, are a central
topic of study in parameterized complexity. A main aim of research in this area is to …

In this paper we study the Grundy domination number on the X-join product G↩ R of a graph
G and a family of graphs R={G v: v∈ V (G)}. The results led us to extend the few known …

The Grundy number of a graph is the maximum number of colors used by the greedy
coloring algorithm over all vertex orderings. In this paper, we study the computational …

In this paper, we answer a long-standing open question proposed by Bodlaender in 1991:
the game chromatic number is PSPACE-hard. We also prove that the game Grundy number …

A proper colouring of a graph is a function that assigns a colour to each vertex with the
restriction that adjacent vertices are assigned with distinct colours. Proper colourings are a …

In this paper, we answer a long-standing open question proposed by Bodlaender in 1991:
the game chromatic number is PSPACE-hard. We also prove that the game Grundy number …

A map $ c: V (G)\rightarrow\{1,\dots, k\} $ of a graph $ G $ is a packing $ k $-coloring if every
two different vertices of the same color $ i\in\{1,\dots, k\} $ are at distance more than $ i …

A Grundy coloring of a graph G is a proper vertex coloring of G where any vertex x, colored
with c (x), has a neighbor of any color 1, 2,..., c (x)-1. A central graph G^ c is obtained from G …

In this paper we consider a variant of graph partitioning consisting in partitioning the vertex
set of a graph into the minimum number of sets such that each of them induces a graph in …

This thesis is divided in two parts, where the first one concerns the inversion number of
oriented graphs. Let D be an oriented graph. The inversion of a set X of vertices in D …