Cutting a tree with Subgraph Complementation is hard, except for some small trees

Dhanyamol Antony, Sagartanu Pal, R. B. Sandeep +1

For a graph property $\Pi$, Subgraph Complementation to $\Pi$ is the problem to find whether there is a subset $S$ of vertices of the input graph $G$ such that modifying $G$ by complem…