Spanning trees whose stems are caterpillars

DOI10.1556/012.2024.04310MaRDI QIDQ6607849FDOQ6607849

Authors: Pham Hoang Ha, Dang Dinh Hahn, Le Dinh Nam, Nguyen Huu Nhan 

Publication date: 19 September 2024

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

Recommendations

• Spanning trees whose stems have a bounded number of branch vertices
• Spanning trees of connected \(K_{1,t}\)-free graphs whose stems have a few leaves
• Spanning caterpillars having at most \(k\) leaves
• Spanning trees whose stems have at most \(k\) leaves.
• Spanning trees whose stems are spiders

zbMATH Keywords

spanning treecaterpillarstem

Mathematics Subject Classification ID

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

This page was built for publication: Spanning trees whose stems are caterpillars

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