An upper bound for the radius of a 3-connected graph (Q1313873): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the radius of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4189296 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Even graphs / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(93)90306-e / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1998333579 / rank | |||
Normal rank | |||
Latest revision as of 09:45, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An upper bound for the radius of a 3-connected graph |
scientific article |
Statements
An upper bound for the radius of a 3-connected graph (English)
0 references
19 May 1994
0 references
3-connected graph
0 references
radius
0 references
