Spanning caterpllars with bounded diameter

DOI10.7151/DMGT.1011zbMATH Open0845.05030OpenAlexW2012535843MaRDI QIDQ4882586FDOQ4882586

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

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

zbMATH Keywords

distancediameterspanning treecaterpillar

Mathematics Subject Classification ID

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

Cited In (9)

• Caterpillar arboricity of planar graphs
• Characterizing when powers of a caterpillar are divisor graphs.
• Spanning caterpillar in biconvex bipartite graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Euclidean networks with a backbone and a limit theorem for minimum spanning caterpillars
• Spanning caterpillars having at most \(k\) leaves

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)