Abstract
Las Vergnas (CR Acad Sci Paris Sér A 272:1297–1300, 1971), and Broersma and Tuinstra (J Graph Theory 29:227–237, 1998) independently investigated a degree sum condition for a graph to have a spanning tree whose number of leaves is restricted. In this paper, we obtain the bipartite analogy of this result.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Broersma, H., Tuinstra, H.: Independence trees and Hamilton cycles. J. Graph Theory. 29, 227–237 (1998)
Kano, M., Matsuda, H., Tsugaki, M., Yan, G.: Spanning \(k\)-ended trees of bipartite graphs. Discrete Math. 313, 2903–2907 (2013)
Las Vergnas, M.: Sur une propriété des arbres maximaux dans un graphe. CR Acad. Sci. Paris Sér A. 272, 1297–1300 (1971)
Ore, O.: Hamilton connected graph. J. Math. Pures. Appl. 42, 21–27 (1963)
Matsubara, R., Matsumura, H., Tsugaki, M., Yamashita, T.: Degree sum conditions for path-factors with specified end vertices in bipartite graphs. Discrete Math. 340, 87–95 (2017)
Acknowledgements
The author would like to thank Professor Tomoki Yamashita and the referees for their valuable comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Tsugaki, M. A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph. Graphs and Combinatorics 34, 693–701 (2018). https://doi.org/10.1007/s00373-018-1906-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-018-1906-8