4 problems

Given a graph $G=(V,E)$ and an integer $k$, determine whether there exists an edge set $F\subseteq E$ with $|F|\le k$ such that every connected component of $G-F$ has diameter at m…

RPP PSAKS conjecture. RPP has a PSAKS with respect to the parameter $c$.

The nowhere-dense domination-set kernelization dichotomy. If $\mathcal{C}$ is nowhere dense, then for each $r\in\mathbb{N}$, the textsc{Distance-$r$ Dominating Set} problem admits…

Let $G$ be a graph with a given rotation system, and let $k\geq 1$ be an integer. A drawing of $G$ respecting the prescribed rotation system is one in which the clockwise order of…