Spanning trees whose stems have a bounded number of branch vertices

DOI10.7151/DMGT.1885zbMath1339.05212OpenAlexW2339440053MaRDI QIDQ726654

Zheng Yan

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1885

zbMATH Keywords

spanning treestembranch vertex

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40) Vertex degrees (05C07)

Related Items (6)

Conditions for spanning trees whose internal subtrees have few branch vertices and leaves ⋮ Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Spanning trees with few peripheral branch vertices ⋮ Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves ⋮ Spanning trees whose reducible stems have a few branch vertices ⋮ Spanning \(k\)-ended trees in quasi-claw-free graphs

Cites Work

• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• Spanning spiders and light-splitting switches
• Neighborhood unions and extremal spanning trees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning trees whose stems have a bounded number of branch vertices