"An upper bound for the radius of a 3-connected graph."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Jochen Harant (1993)

> Home

Details and statistics

DOI: 10.1016/0012-365X(93)90306-E

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/Harant93a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Harant93a
Jochen Harant:
An upper bound for the radius of a 3-connected graph. Discret. Math. 122(1-3): 335-341 (1993)

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.