Spanning trees with few peripheral branch vertices

DOI10.11650/tjm/201201zbMath1479.05054OpenAlexW3111310291MaRDI QIDQ2233620

Pham Hoang Ha, Dang Dinh Hanh, Nguyen Thanh Loan

Publication date: 11 October 2021

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11650/tjm/201201

zbMATH Keywords

independence numberspanning treedegree sumleafperipheral branch vertex

Mathematics Subject Classification ID

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

Related Items (3)

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 reducible stems have a few branch vertices

Cites Work

• Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees: A survey
• Spanning trees whose stems have a bounded number of branch vertices
• Spanning trees whose stems are spiders
• 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
• 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
• Hamiltonian results inK1,3-free graphs
• Independence trees and Hamilton cycles
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning trees with few peripheral branch vertices