A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected (Q2115234)
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 7490430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected |
scientific article; zbMATH DE number 7490430 |
Statements
A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected (English)
0 references
15 March 2022
0 references
graphic sequence
0 references
forcibly \(k\)-edge-connected graphic sequence
0 references
strongest monotone degree condition
0 references
0.8317103385925293
0 references
0.8274968266487122
0 references
0.8157601356506348
0 references
0.81382817029953
0 references
0.8063160181045532
0 references
