The minimum number of edges in a vertex diameter-2-critical graph

DOI10.1016/S0012-365X(96)00215-4zbMath0874.05022OpenAlexW1991346464MaRDI QIDQ1356444

Yoshimi Egawa, Kiyoshi Ando

Publication date: 9 November 1997

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(96)00215-4

zbMATH Keywords

vertex diameter-2-critical

Mathematics Subject Classification ID

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

Related Items (1)

Maximal and minimal vertex-critical graphs of diameter two

Cites Work

• Unnamed Item
• On diameter 2-critical graphs
• On diameter critical graphs
• The maximum number of edges in a minimal graph of diameter 2
• Diameter bounds for altered graphs

This page was built for publication: The minimum number of edges in a vertex diameter-2-critical graph