Spanning trees of K_1,4-free graphs whose reducible stems have few leaves

2023/05/12 by Ha, Pham Hoang, Nam, Le Dinh, Pham, Ngoc Diep
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2305.07232

Abstract

Let T be a tree, a vertex of degree one is a leaf of T and a vertex of degree at least three is a branch vertex of T. The \it reducible stem of T is the smallest subtree that contains all branch vertices of T. In this paper, we give some sharp sufficient conditions for K_1,4-free graphs to have a spanning tree whose reducible stem having few leaves.

Related

• A note on spanning trees of connected K_1,t-free graphs whose stems\n have a few leaves
• Spanning trees of K_1,4-free graphs with a bounded number of leaves and branch vertices
• Spanning trees of a claw-free graph whose reducible stems have few leaves
• Spanning trees of claw-free graphs with few leaves and branch vertices
• Spanning trees in a Claw-free graph whose stems have at most k branch vertices