Petr A. Golovach

Distance constrained labelings of graphs of bounded treewidth

We prove that the L(2,1)-labeling problem is NP-complete for graphs of treewidth two, thus adding a natural and well studied problem to the short list of problems whose computational complexity separates treewidth one from treewidth two. We prove similar results for other variants of the distance constrained graph labeling problem.

A survey on the computational complexity of coloring graphs with forbidden subgraphs.

For a positive integer

Complexity of the packing coloring problem for trees

k

Parameterized complexity of coloring problems: Treewidth versus vertex cover

, a

Intractability of Clique-Width Parameterizations

k

Paths of bounded length and their cuts: Parameterized complexity and algorithms

-colouring of a graph

The capture time of a graph

G=(V,E)

Three Complexity Results on Coloring Pk-Free Graphs

is a mapping

On tractability of Cops and Robbers game

c: V\rightarrow\{1,2,...,k\}

Parameterized Complexity for Domination Problems on Degenerate Graphs

such that