Spanning trees of a K₁,5-free graph with at most seven leaves and branch vertices in total

DOI10.1556/012.2025.04334MaRDI QIDQ6872183zbMATH OpenFDO

Authors Pham Ngoc Diep, Pham Hoang Ha, Bui Ngoc Tu

Publication date 20 January 2026

Published in Studia Scientiarum Mathematicarum Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1556/012.2025.04334

zbMATH Keywords

\(K_{1,5}\)-free, degree sumspanning tree

Mathematics Subject Classification ID

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

Cited in

(1)

• Spanning trees of claw-free graphs with few leaves and branch vertices

This page was built for publication: Spanning trees of a \(K_{1,5}\)-free graph with at most seven leaves and branch vertices in total

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