Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total

DOI10.1556/012.2022.01521zbMath1499.05089OpenAlexW4220932611WikidataQ113234195 ScholiaQ113234195MaRDI QIDQ5074694

Dang Dinh Hanh

Publication date: 9 May 2022

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

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

zbMATH Keywords

spanning treebranch verticesclaw-freeleaves

Mathematics Subject Classification ID

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

Related Items (3)

Spanning trees with few peripheral branch vertices in a connected claw-free graph ⋮ Spanning trees with at most \(5\) leaves and branch vertices in total of \(K_{1,5}\)-free graphs ⋮ Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices

This page was built for publication: Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total