Spanning 5-ended trees in \(K_{1,5}\)-free graphs

DOI10.1007/s40840-019-00821-wzbMath1437.05062OpenAlexW2965216116MaRDI QIDQ1988569

Pei Sun, Zhi-quan Hu

Publication date: 23 April 2020

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-019-00821-w

zbMATH Keywords

\(K_{1, 5}\)-free graph\(m\)-ended tree

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs

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 at most 3 leaves in \(K_{1,4}\)-free graphs
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Spanning spiders and light-splitting switches
• Independence trees and Hamilton cycles

This page was built for publication: Spanning 5-ended trees in \(K_{1,5}\)-free graphs