Spanning caterpllars with bounded diameter
From MaRDI portal
Publication:4882586
Recommendations
Cited in
(9)- Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
- Characterizing when powers of a caterpillar are divisor graphs.
- scientific article; zbMATH DE number 1750102 (Why is no real title available?)
- Spanning caterpillars having at most \(k\) leaves
- Caterpillar arboricity of planar graphs
- scientific article; zbMATH DE number 3948293 (Why is no real title available?)
- scientific article; zbMATH DE number 4132179 (Why is no real title available?)
- scientific article; zbMATH DE number 841658 (Why is no real title available?)
- Spanning caterpillar in biconvex bipartite graphs
This page was built for publication: Spanning caterpllars with bounded diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4882586)