The strongest monotone degree condition for \(n\)-connectedness of a graph (Q2560834): Difference between revisions
From MaRDI portal
Latest revision as of 12:58, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The strongest monotone degree condition for \(n\)-connectedness of a graph |
scientific article |
Statements
The strongest monotone degree condition for \(n\)-connectedness of a graph (English)
0 references
1974
0 references