Spanning trees whose stems have a bounded number of branch vertices

DOI10.7151/DMGT.1885MaRDI QIDQ726654zbMATH OpenOpenAlexFDO

Authors Zheng Yan

Publication date 13 July 2016

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

branch vertexspanning treestem

Mathematics Subject Classification ID

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

Recommendations

• Spanning trees whose reducible stems have a few branch vertices.
• 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 stems have at most k leaves.
• scientific article; zbMATH DE number 6424518

Cites work

• scientific article; zbMATH DE number 2038756 (Why is no real title available?)
• scientific article; zbMATH DE number 2086635 (Why is no real title available?)
• scientific article; zbMATH DE number 6424518 (Why is no real title available?)
• Neighborhood unions and extremal spanning trees
• Spanning spiders and light-splitting switches
• Spanning trees whose stems have at most k leaves.
• 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

Cited in

(14)

• Degree conditions for graphs to have spanning trees with few branch vertices and leaves
• Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves
• Spanning trees with few peripheral branch vertices
• Spanning k-ended trees in quasi-claw-free graphs
• 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 whose stems have at most k leaves.
• Spanning trees whose reducible stems have a few branch vertices.
• On the number of Sperner vertices in a tree
• Spanning Trees with Few Branch Vertices
• scientific article; zbMATH DE number 7132826 (Why is no real title available?)
• Spanning trees whose stems are caterpillars
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• Spanning trees whose stems are spiders

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q726654)