A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected (Q2115234): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Jian Hua Yin / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Ji-Yun Guo / rank | |||
Normal rank | |||
Revision as of 02:36, 12 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected |
scientific article |
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
