For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improve on Loryś and Zwoźniak's result presenting a 5/3-approximation for this problem on cubic graphs. This result is a consequence of new lower and upper bounds for L(G) which are interesting on their own. We also show a lower bound for L(G) that holds for graphs with minimum degree at least 3. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Correa, J. R., Fernandes, C. G., Matamala, M., & Wakabayashi, Y. (2008). A 5/3-approximation for finding spanning trees with many leaves in cubic graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4927 LNCS, pp. 184–192). https://doi.org/10.1007/978-3-540-77918-6_15
Mendeley helps you to discover research relevant for your work.