Packing constants in graphs and connectivity

DOI10.1016/0012-365X(93)E0135-QzbMath0812.05041OpenAlexW2124645297WikidataQ127935554 ScholiaQ127935554MaRDI QIDQ1343800

Peter Brass

Publication date: 9 May 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)e0135-q

zbMATH Keywords

distanceconnectivityboundpacking constants

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Connectivity (05C40)

Related Items (1)

On graphs which contain each tree of given size

Cites Work

• A generalisation of the diameter of a graph
• Unnamed Item

This page was built for publication: Packing constants in graphs and connectivity