Realizability of \(n\)-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree. III. (Q2971198)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6700478
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Realizability of \(n\)-vertex graphs with prescribed vertex connectivity, edge connectivity, minimum degree, and maximum degree. III. |
scientific article; zbMATH DE number 6700478 |
Statements
4 April 2017
0 references
vertex connectivity
0 references
edge connectivity
0 references
realizable
0 references
minimum degree
0 references
maximum degree
0 references
0.9878136515617372
0 references
0.8786576986312866
0 references
