Spanning Trees with Vertices Having Large Degrees


Let G be a connected simple graph, and let f be a mapping from V (G) to the set of integers. This paper is concerned with the existence of a spanning tree in which each vertex v has degree at least f(v). We show that if ∣∣ΓG(S)∣∣− f(S)+ |S| ≥ 1 for any nonempty subset S ⊆ L, then a connected graph G has a spanning tree such that dT (x) ≥ f(x) for all x ∈ V… (More)
DOI: 10.1002/jgt.21824

1 Figure or Table


  • Presentations referencing similar topics