Spanning Trees of a Claw-Free Graph Whose Reducible Stems Have Few Leaves

DOI10.1556/012.2023.01538arXiv2112.04102OpenAlexW4386478563MaRDI QIDQ6155584

Pham Hoang Ha

Publication date: 5 June 2023

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

Full work available at URL: https://arxiv.org/abs/2112.04102

zbMATH Keywords

spanning treeclaw-free graphleafreducible stem

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)