We show that the Maximum Weight Independent Set problem (MWIS) can be solved in quasi-
polynomial time on H-free graphs (graphs excluding a fixed graph H as an induced …

In the Maximum Independent Set problem we are asked to find a set of pairwise
nonadjacent vertices in a given graph with the maximum possible cardinality. In general …

We revisit the recent polynomial-time algorithm for the MAX WEIGHT INDEPENDENT SET
(MWIS) problem in bounded-degree graphs that do not contain a fixed graph whose every …

For graphs $ G $ and $ H $, an $ H $-coloring of $ G $ is an edge-preserving mapping from
$ V (G) $ to $ V (H) $. In the $ H $-Coloring problem the graph $ H $ is fixed and we ask …

Many recent works address the question of characterizing induced obstructions to bounded
treewidth. In 2022, Lozin and Razgon completely answered this question for graph classes …

Abstract We study the Independent Set problem in H-free graphs, ie, graphs excluding some
fixed graph H as an induced subgraph. We prove several inapproximability results both for …

In the Maximum Independent Set problem we are asked to find a set of pairwise
nonadjacent vertices in a given graph with the maximum possible cardinality. In general …

A homomorphism from a graph G to a graph H is an edge-preserving mapping from the
vertex set of G to the vertex set of H. Graph homomorphisms are a wide and natural …

4.1 Wprowadzenie Homomorfizmem z grafu G w graf H nazywamy funkcję ze zbioru
wierzchołków grafu G w zbiór wierzchołków grafu H, która zachowuje krawędzie. Jeśli G ma …