We study Steiner Forest on H-subgraph-free graphs, that is, graphs that ...
For any finite set ℋ = {H_1,…,H_p} of graphs, a graph is
ℋ-subgraph-free...
A graph G is H-subgraph-free if G does not contain H as a (not
necessari...
For any finite set ℋ = {H_1,…,H_p} of graphs, a graph is
ℋ-subgraph-free...
We show that Edge Multiway Cut (also called Multiterminal Cut) and Node
...
Paths P^1,…,P^k in a graph G=(V,E) are mutually induced if any two
disti...
Paths P_1,…, P_k in a graph G=(V,E) are mutually induced if any two
dist...
For a fixed integer, the k-Colouring problem is to decide if the vertice...
The well-known Disjoint Paths problem is to decide if a graph contains k...
A natural way of increasing our understanding of NP-complete graph probl...
We examine the effect of bounding the diameter for well-studied variants...
We give a complexity dichotomy for the Quantified Constraint Satisfactio...
For k≥ 1, a k-colouring c of G is a mapping from V(G) to
{1,2,…,k} such ...
A graph class is hereditary if it is closed under vertex deletion. We gi...
We classify the complexity of L(p,q)-Edge-k-Labelling in the sense that ...
A k-colouring c of a graph G is a mapping V(G) to 1,2,... k such that c(...