Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs

DOI10.1007/s11425-014-4817-zzbMath1299.05034OpenAlexW2290059144MaRDI QIDQ477134

Guantao Chen, Yuan Chen, Zhi-quan Hu

Publication date: 2 December 2014

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-014-4817-z

zbMATH Keywords

spanning treedegree suminsertible vertexsegment insertion

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Related Items (10)

Spectral radius and spanning trees of graphs ⋮ Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs ⋮ Spanning 3-ended trees in almost claw-free graphs ⋮ Spanning trees with few peripheral branch vertices ⋮ Bipartition of graph under degree constraints ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ Spanning trees whose reducible stems have a few branch vertices ⋮ Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs ⋮ Spanning \(k\)-ended trees in quasi-claw-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees: A survey
• Hamilton connected graphs
• 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
• Neighborhood unions and extremal spanning trees
• Hamiltonian results inK1,3-free graphs
• Hamilton cycles in claw-free graphs
• Independence trees and Hamilton cycles
• Hamiltonicity for K_{1, r}‐free graphs

This page was built for publication: Spanning 3-ended trees in \(k\)-connected \(K_{1,4}\)-free graphs