An Upper Bound on the Number of Edges of a 2-Connected Graph (Q3123115): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1017/s0963548396002787 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1982554476 / rank | |||
Normal rank | |||
Latest revision as of 08:52, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Upper Bound on the Number of Edges of a 2-Connected Graph |
scientific article |
Statements
An Upper Bound on the Number of Edges of a 2-Connected Graph (English)
0 references
6 March 1997
0 references
number of edges
0 references
edge connectivity
0 references
2-connected
0 references
