We prove that a number of computational problems that ask for the larges...
We prove that every connected P_5-free graph has cop number at most two,...
For graphs G and H, we say that G is H-free if it does not contain
H as ...
Let s and t be positive integers. We use P_t to denote the path with
t v...
For a graph F, a graph G is F-free if it does not contain an
induced sub...
We study the Max Partial H-Coloring problem: given a graph G,
find the l...
A hole in a graph is an induced cycle of length at least 4. A hole is lo...
A hole in a graph is an induced cycle with at least 4 vertices. A
graph ...
A vertex in a graph is simplicial if its neighborhood forms a clique. We...
In the Maximum Independent Set problem we are asked to find a set of pai...
A hole in a graph is an induced cycle of length at least 4, and an antih...
This is the second paper in a series of two. The goal of the series is t...
This is the first paper in a series whose goal is to give a polynomial t...