Spanning caterpillars having at most k leaves

DOI10.1007/978-3-642-45281-9_9MaRDI QIDQ2864332zbMATH OpenOpenAlexFDO

Authors Tomoki Yamashita, Zheng Yan, Mikio Kano

Publication date 6 December 2013

Published in Computational Geometry and Graphs (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45281-9_9

Mathematics Subject Classification ID

Trees (05C05) Connectivity (05C40)

Recommendations

• Spanning caterpllars with bounded diameter
• Spanning trees whose stems have at most k leaves.
• Spanning trees of bounded degree
• Bounds of the number of leaves of spanning trees
• Spanning trees with a bounded number of leaves

Cited in

(6)

• Caterpillars on three and four leaves are sufficient to binary normal networks
• Arbitrarily vertex decomposable caterpillars with four or five leaves
• scientific article; zbMATH DE number 841658 (Why is no real title available?)
• Spanning caterpllars with bounded diameter
• Spanning caterpillar in biconvex bipartite graphs
• Spanning trees whose stems are caterpillars

This page was built for publication: Spanning caterpillars having at most \(k\) leaves

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