Abstract
If M is a perfect matching in a k-connected graph G with independence number \(\alpha \le 1 + {3 \over 2}k\), then M can be extended to a spanning tree of G with maximum degree at most three.
Similar content being viewed by others
References
Bondy, J.A., Murty, U.S.R.: Graph theory with applications, North Holland, New York, 1981
Chvátal, V., Erdös, P.: A Note on hamiltonian circuits, Discrete Math. 2, 111–113 (1972)
Neumann-Lara, V., Rivera-Campo, E.: Spanning trees with bounded degrees, Combinatorica 11(1), 55–61 (1991)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rivera-Campo, E. A Note on Matchings and Spanning Trees with Bounded Degrees. Graphs and Combinatorics 13, 159–165 (1997). https://doi.org/10.1007/BF03352993
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF03352993