The Leafed Induced Subtree in chordal and bounded treewidth graphs

Julien Baste

In the Fully Leafed Induced Subtrees, one is given a graph $G$ and two integers $a$ and $b$ and the question is to find an induced subtree of $G$ with $a$ vertices and at least $b$…