We show that several reconfiguration problems known to be PSPACE-complete remain so
even when limited to graphs of bounded bandwidth (and hence pathwidth and treewidth) …

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 …

We present a polynomial-time algorithm that, given two independent sets in a claw-free
graph G, decides whether one can be transformed into the other by a sequence of …

Inductive k k-independent graphs generalize chordal graphs and have recently been
advocated in the context of interference-avoiding wireless communication scheduling. The …

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 present a construction called layered wheel. Layered wheels are graphs of arbitrarily
large treewidth and girth. They might be an outcome for a possible theorem characterizing …

Abstract The Maximum Weight Independent Set (MWIS) problem on finite undirected graphs
with vertex weights asks for a set of pairwise nonadjacent vertices of maximum weight sum …

Perfect graphs were defined by Claude Berge in the 1960s. They are important objects for
graph theory, linear programming and combinatorial optimization. Claude Berge made a …

The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In
particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a …

Let G be a graph. A set\(S\subseteq V (G)\) is independent if its elements are pairwise
nonadjacent. A vertex\(v\in V (G)\) is shedding if for every independent set\(S\subseteq V …