Spanning trees whose reducible stems have a few branch vertices

DOI10.21136/CMJ.2021.0073-20MaRDI QIDQ4959538

Pham Hoang Ha, Dang Dinh Hanh, Nguyen Thanh Loan, Ngoc Diep Pham

Publication date: 16 September 2021

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

independence numberspanning treedegree sumreducible stem

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Unnamed Item
• 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 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
• Hamiltonian results inK1,3-free graphs
• Independence trees and Hamilton cycles
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs

This page was built for publication: Spanning trees whose reducible stems have a few branch vertices