Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs

DOI10.11650/tjm/240606MaRDI QIDQ6619687

Nguyen Hoang Trang, Pham Hoang Ha

Publication date: 16 October 2024

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

spanning treedegree sum\(K_{1,5}\)-free

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Spanning trees homeomorphic to a small tree
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Degree conditions for graphs to have spanning trees with few branch vertices and leaves
• Spanning spiders and light-splitting switches
• Spanning 5-ended trees in \(K_{1,5}\)-free graphs
• A note on the independence number, connectivity and \(k\)-ended tree
• On spanning trees with few branch vertices
• Hamiltonian results inK1,3-free graphs
• Independence trees and Hamilton cycles
• Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs

This page was built for publication: Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs