"A Simple Proof of Ore's Theorem on the Maximum Size of k-connected Graphs ..."

Leilei Zhang (2023)

> Home

Details and statistics

DOI: 10.1007/S00373-023-02628-W

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gc/Zhang23a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gc/Zhang23a
Leilei Zhang:
A Simple Proof of Ore's Theorem on the Maximum Size of k-connected Graphs with Given Order and Diameter. Graphs Comb. 39(2): 33 (2023)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.