Abstract
A spanning tree can be considered as a special connected factor, and often appears in many branches of combinatorics. In this section we give a variety of sufficient conditions for a connected graph to have a spanning tree possessing a certain prescribed property. For example, in Section 8.2, we consider spanning trees with maximum degree at most k, and in Section 8.3, we deal with spanning trees having at most k leaves.We begin with some basic results on spanning trees, including minimum spanning trees in a weighted graph.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Akiyama, J., Kano, M. (2011). Spanning Trees. In: Factors and Factorizations of Graphs. Lecture Notes in Mathematics(), vol 2031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21919-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-21919-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21918-4
Online ISBN: 978-3-642-21919-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)