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

DOI10.1007/S11425-014-4817-ZzbMATH Open1299.05034OpenAlexW2290059144MaRDI QIDQ477134FDOQ477134

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

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

zbMATH Keywords

degree sumspanning treeinsertible vertexsegment insertion

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Cites Work

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

Cited In (16)

• Spanning 3-ended trees in almost claw-free graphs
• Spanning trees with few peripheral branch vertices
• Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
• Spanning trees with at most \(k\) leaves in 2-connected \(K_{1 , r}\)-free graphs
• Spectral radius and spanning trees of graphs
• Title not available (Why is that?)
• Toughness and spanning trees in K4‐minor‐free graphs
• Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs
• Spanning trees with at most \(k\) 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 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning trees with at most 3 leaves in \(K_{1,4}\)-free graphs
• Bipartition of graph under degree constraints
• Spanning \(k\)-ended trees in quasi-claw-free graphs
• Spanning trees with few peripheral branch vertices in a connected claw-free graph
• Spanning trees whose reducible stems have a few branch vertices

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)