Treewidth is as an important parameter that yields tractability for many...
We investigate a relaxation of the notion of treewidth-fragility, namely...
In the Directed Steiner Network problem, the input is a directed graph G...
The leafage of a chordal graph G is the minimum integer l such that G ca...
For a graph G, a subset S ⊆ V(G) is called a resolving set
if for any tw...
We consider the problem of reducing the (semi)total domination number of...
The Edge Multicut problem is a classical cut problem where given an
undi...
In this paper, we consider the problem of reducing the semitotal dominat...
In this note, we consider the following problem: given a connected graph...
In this paper, we study the problem of deciding whether the total domina...
We consider Independent Set and Dominating Set restricted to VPG graphs ...
A contact B_0-VPG graph is a graph for which there exists a collection o...
In this paper, we consider the following problem: given a connected grap...
In this paper we continue the systematic study of Contact graphs of Path...
In this paper, we study the following problem: given a connected graph G...
For every fixed integer k ≥ 1, we prove that k-Edge Colouring is
fixed-p...
We show that for any k ≥ 0, there exists a planar graph which is
B_k+1-C...
A semitotal dominating set of a graph G with no isolated vertex is a
dom...
A graph is H-free if it does not contain an induced subgraph isomorphic ...
In this paper we present a characterisation, by an infinite family of mi...
In this paper we consider Contact graphs of Paths on a Grid (CPG graphs)...