Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1356444
Jump to:navigation, search

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

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
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1356444&oldid=13494311"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki