Abstract
Let G be a connected simple graph, let X⊆V (G) and let f be a mapping from X to the set of integers. When X is an independent set, Frank and Gyárfás, and independently, Kaneko and Yoshimoto gave a necessary and sufficient condition for the existence of spanning tree T in G such that d T (x) for all x ∈ X, where d T (x) is the degree of x and T. In this paper, we extend this result to the case where the subgraph induced by X has no induced path of order four, and prove that there exists a spanning tree T in G such that d T (x) ≥ f(x) for all x ∈ X if and only if for any nonempty subset S ⊆ X, |N G (S) − S| − f(S) + 2|S| − ω G (S) ≥, where ω G (S) is the number of components of the subgraph induced by S.
Similar content being viewed by others
References
A. Frank and A. Gyárfás: How to orient the edges of a graph? Colloq. Math. Soc. János Bolyai 18 (1976), 353–364.
A. Kaneko and K. Yoshimoto: On spanning trees with restricted degrees, Inform. Process. Lett. 73 (2000), 163–165.
A. Schrijver: Combinatorial Optimization, Springer, 2003.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Egawa, Y., Ozeki, K. A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees. Combinatorica 34, 47–60 (2014). https://doi.org/10.1007/s00493-014-2576-7
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00493-014-2576-7