Spanning trees with few peripheral branch vertices in a connected claw-free graph

DOI10.1007/s10474-023-01295-wOpenAlexW4319346756MaRDI QIDQ2694860

Yanyan Li

Publication date: 4 April 2023

Published in: Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10474-023-01295-w

zbMATH Keywords

spanning treeleafclaw-freeperipheral branch vertexreducible stem

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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 with a bounded number of branch vertices in a claw-free graph
• 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
• Spanning trees with few peripheral branch vertices
• On spanning trees with few branch vertices
• Independence trees and Hamilton cycles
• Spanning trees whose reducible stems have a few branch vertices
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs

This page was built for publication: Spanning trees with few peripheral branch vertices in a connected claw-free graph