Upper and lower bounds for graph-diameter problems with application to Record allocation

DOI10.1016/0095-8956(79)90042-XzbMath0406.05038MaRDI QIDQ1257489

K. Appert

Publication date: 1979

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

zbMATH Keywords

GraphDiameterLower BoundsUpper BoundsApplication to Record Allocation

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38)

Cites Work

• On the diameter of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Upper and lower bounds for graph-diameter problems with application to Record allocation