Conditions for spanning trees whose internal subtrees have few branch vertices and leaves

DOI10.1007/s00574-023-00331-1OpenAlexW4323075893MaRDI QIDQ2693743

Dang Dinh Hanh

Publication date: 24 March 2023

Published in: Bulletin of the Brazilian Mathematical Society. New Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00574-023-00331-1

zbMATH Keywords

independence numberspanning treebranch verticesleavesinternal subtree

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Cites Work

• Spanning trees whose stems have a bounded number of branch vertices
• Spanning trees homeomorphic to a small tree
• Degree conditions for graphs to have spanning trees with few branch vertices and leaves
• Spanning trees with few peripheral branch vertices
• On spanning trees with few branch vertices
• Spanning trees whose reducible stems have a few branch vertices
• Unnamed Item

This page was built for publication: Conditions for spanning trees whose internal subtrees have few branch vertices and leaves