The number of spanning trees in 4-regular simple graphs
JS Sereni, ZB Yilma - The Electronic Journal of Combinatorics, 2024 - combinatorics.org
Extending an earlier work by Kostochka for subcubic graphs, we show that a connected
graph $ G $ with minimum degree $2 $ and maximum degree $4 $ has at least $75^{n_4/5+ …
graph $ G $ with minimum degree $2 $ and maximum degree $4 $ has at least $75^{n_4/5+ …