On the minimum leaf number of cubic graphs

Jan Goedgebeur, Kenta Ozeki, Nico Van Cleemput +1

The \emph{minimum leaf number} $ml(G)$ of a connected graph $G$ is defined as the minimum number of leaves of the spanning trees of $G$. We present new results concerning t…