Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves

DOI10.1007/S40840-019-00812-XzbMath1437.05044arXiv1810.08336OpenAlexW2963865019MaRDI QIDQ1988553

Pham Hoang Ha, Dang Dinh Hanh

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://arxiv.org/abs/1810.08336

zbMATH Keywords

leafstem\(K_{1, t}\)-free

Mathematics Subject Classification ID

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

Related Items (4)

Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Spanning trees with few peripheral branch vertices ⋮ The maximum number of spanning trees of a graph with given matching number ⋮ Spanning trees whose reducible stems have a few branch vertices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spanning trees: A survey
• Spanning trees whose stems have a bounded number of branch vertices
• Spanning trees whose stems are spiders
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Independence trees and Hamilton cycles

This page was built for publication: Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves