Spanning 3-ended trees in k-connected K₁,4-free graphs

DOI10.1007/S11425-014-4817-ZMaRDI QIDQ477134zbMATHOpenAlexFDO

Authors Guantao Chen, Yuan Chen, Zhiquan 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

degree sumspanning treeinsertible vertexsegment insertion

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Recommendations

• scientific article; zbMATH DE number 6770068
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning 3-ended trees in almost claw-free graphs

Cites work

• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• Hamilton connected graphs
• Hamilton cycles in claw-free graphs
• Hamiltonian results inK1,3-free graphs
• Hamiltonicity for K_{1, r}‐free graphs
• Independence trees and Hamilton cycles
• Neighborhood unions and extremal spanning trees
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Spanning trees with a bounded number of leaves in a claw-free graph.
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees: A survey

Cited in

(18)

• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs
• Spanning trees with few peripheral branch vertices
• Bipartition of graph under degree constraints
• scientific article; zbMATH DE number 6770068 (Why is no real title available?)
• Toughness and spanning trees in K4‐minor‐free 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 at most 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning trees with at most 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning \(k\)-ended trees in quasi-claw-free graphs
• Spanning 5-ended trees in \(K_{1,5}\)-free graphs
• Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
• Spanning \(k\)-ended trees of 3-regular connected graphs
• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
• Spectral radius and spanning trees of graphs
• Spanning trees whose reducible stems have a few branch vertices.
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q477134)