Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number (Q1717211)
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 7014699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number |
scientific article; zbMATH DE number 7014699 |
Statements
Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number (English)
0 references
7 February 2019
0 references
edge-connectivity
0 references
clique number
0 references
maximally edge-connected graphs
0 references
super-edge-connected graphs
0 references
0.8939032554626465
0 references
0.8677603006362915
0 references
0.864829421043396
0 references
0.864829421043396
0 references
