Spanning trees with a bounded number of branch vertices in a K₁,4-free graph

DOI10.7151/DMGT.2419MaRDI QIDQ6985959zbMATH OpenFDO

Authors Dang Dinh Hanh

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2419

zbMATH Keywords

\(K_{1,4}\)-freebranch verticesspanning tree

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites work

• scientific article; zbMATH DE number 7132826 (Why is no real title available?)
• Longest paths and cycles in K1,3-free graphs
• Neighborhood unions and extremal spanning trees
• On spanning trees with few branch vertices
• Spanning 5-ended trees in \(K_{1,5}\)-free graphs
• Spanning spiders and light-splitting switches
• Spanning trees with a bounded number of branch vertices in a claw-free graph
• 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 4 leaves in \(K_{1, 5}\)-free graphs
• Spanning trees with at most \(k\) leaves in \(K_{1,4}\)-free graphs

Cited in

(2)

• Spanning trees of \(K_{1,4}\)-free graphs with a bounded number of leaves and branch vertices
• Spanning trees of claw-free graphs with few leaves and branch vertices

This page was built for publication: Spanning trees with a bounded number of branch vertices in a \(K_{1,4}\)-free graph

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