On the feasible tree-diameter sets of graphs

DOI10.1109/TCS.1985.1085785zbMATH Open0717.05031OpenAlexW2044330208MaRDI QIDQ3204482FDOQ3204482

Authors Toshihiko Shimizu, Yukio Shibata

Publication date 1985

Published in IEEE Transactions on Circuits and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tcs.1985.1085785

zbMATH Keywords

feasible tree-diameter set

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• On the diameters of spanning trees
• On upper bounds in tree-diameter sets of graphs
• Spanning trees with small diameters
• scientific article; zbMATH DE number 1043912
• Existence of a spanning tree having small diameter

Cited in

(3)

• Tree-edges deletion problems with bounded diameter obstruction sets
• On numbers of vertices of maximum degree in the spanning trees of a graph
• On the diameters of spanning trees

This page was built for publication: On the feasible tree-diameter sets of graphs

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