Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs

DOI10.1016/j.disc.2024.114009zbMath1539.05016MaRDI QIDQ6542034

Jun-qing Cai, Huiming Zhai, Zuosong Liang

Publication date: 21 May 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

spiderspanning treeleafbranch vertex\(K_{14}\)-free graphspider decomposition

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees: A survey
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Spanning trees homeomorphic to a small tree
• Degree conditions for graphs to have spanning trees with few branch vertices and leaves
• Spanning spiders and light-splitting switches
• On spanning trees with few branch vertices
• Neighborhood unions and extremal spanning trees
• Independence trees and Hamilton cycles
• Reducibility among Combinatorial Problems
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs

This page was built for publication: Spanning trees with few branch vertices in \(K_{1,4}\)-free graphs