Abstract
We give an Ore-type condition sufficient for a graph G to have a spanning tree with a specified degree sequence.
Similar content being viewed by others
References
Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. The McMillan Press, London (1976)
Broersma, H., Tuinstra, H.: Independence tees and Hamilton cycles. J. Graph Theory 29, 227–237 (1998)
Ore, O.: Note on Hamilton circuits. Am. Math. Mon. 67, 55 (1960)
Rivera-Campo, E.: Spanning trees with small degrees and few leaves. Appl. Math. Lett. 25, 1444–1446 (2012)
Win, S.: Existenz von Gerütsen Mit vorgeschriebenem Maximalgraden in Graphen. Abh. Math. Seminar Univ. Hamburg 43, 263–267 (1975)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Partially supported by Conacyt, México.
Rights and permissions
About this article
Cite this article
Martínez-Cuero, M.E., Rivera-Campo, E. A note on spanning trees with a specified degree sequence. Bol. Soc. Mat. Mex. 26, 241–245 (2020). https://doi.org/10.1007/s40590-019-00250-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40590-019-00250-6