Spanning trees and spanning closed walks with small degrees

2017/02/20 by Morteza Hasanvand, Hasanvand, Morteza
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #FOS: Mathematics #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.1702.06203

openalex publication_date 2017/02/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Let G be a graph and let f be a positive integer-valued function on V(G). In this paper, we show that if for all S⊆ V(G), ω(G∖ S)

Related

• Spanning tree-connected subgraphs with small degrees
• On spanning trees with high internal degree
• Spanning closed walks with bounded maximum degrees of graphs on surfaces
• Refinements of degree conditions for the existence of a spanning tree without small degree stems
• Minimum Spanning Trees with Bounded Degrees of Vertices in a Specified Stable Set