Recognizing diameter critical graphs

MaRDI QIDQ4217583zbMATH OpenFDO

Authors R. P. Anstee, Louis Caccetta

Publication date 8 June 1999

zbMATH Keywords

diameter critical graphsextremal graphmatrix multiplication

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Diameter critical graphs
• scientific article; zbMATH DE number 4135979
• scientific article; zbMATH DE number 4097422
• On the diameter of dot-critical graphs
• scientific article; zbMATH DE number 1833089
• On diameter 2-critical graphs
• scientific article; zbMATH DE number 5360704
• On vertex critical graphs with prescribed diameter
• Note: The diameter of edge domination critical graphs
• Testing the diameter of graphs

Cited in

(4)

• An efficient algorithm for testing goal-minimality of graphs
• A characterization of radius-critical graphs
• scientific article; zbMATH DE number 1833089 (Why is no real title available?)
• Graph automorphisms with maximal projection distances

This page was built for publication: Recognizing diameter critical graphs

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