Spanning caterpllars with bounded diameter

DOI10.7151/DMGT.1011MaRDI QIDQ4882586zbMATH OpenOpenAlexFDO

Authors Ralph Faudree, Ronald Gould, Michael Jacobson, Linda Lesniak

Publication date 18 June 1996

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/dmgt.1011

zbMATH Keywords

distancediameterspanning treecaterpillar

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12)

Recommendations

• Spanning caterpillars having at most \(k\) leaves
• Graphs with only caterpillars as spanning trees
• Factorizations of complete graphs into \([n,r,s,2]\)-caterpillars of diameter 5 with maximum center
• scientific article; zbMATH DE number 1750102

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)