Fully leafed induced subtrees

Alexandre Blondin Massé, Julien de Carufel, Alain Goupil +3

Let $G$ be a simple graph on $n$ vertices. We consider the problem LIS of deciding whether there exists an induced subtree with exactly $i\le n$ vertices and $\ell$ leaves in $G$…