scientific article; zbMATH DE number 975404

MaRDI QIDQ5284081zbMATH OpenFDO

Authors

Publication date 19 May 1997

zbMATH Keywords

networkboundsextremal graphspathedge deletions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• An Extremal Problem of Graphs with Diameter 2
• Extremal Graph Theory for Metric Dimension and Diameter
• Extremal graph theory for metric dimension and diameter
• scientific article; zbMATH DE number 3333193
• scientific article; zbMATH DE number 3191789
• scientific article; zbMATH DE number 3258067
• On some extremal problems in graph theory
• Publication:5753977
• scientific article; zbMATH DE number 2170483
• scientific article; zbMATH DE number 3470458

Cited in

(7)

• Edge deletion and invariance in graphs using \(D\)-distance
• Beyond Helly graphs: the diameter problem on absolute retracts
• Extremal graph theory for metric dimension and diameter
• Extremal graphs of diameter at most 6 after deleting any vertex
• scientific article; zbMATH DE number 3995718 (Why is no real title available?)
• Tree-edges deletion problems with bounded diameter obstruction sets
• Property \(P_{d,m}\) and efficient design of reliable networks

This page was built for publication:

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