Kernelization for Finding Lineal Topologies (Depth-First Spanning Trees) with Many or Few Leaves

Emmanuel Sam, Benjamin Bergougnoux, Petr A. Golovach +1

For a given graph $G$, a depth-first search (DFS) tree $T$ of $G$ is an $r$-rooted spanning tree such that every edge of $G$ is either an edge of $T$ or is between a \textit{descen…