A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected (Q2115234): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10255-022-1057-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4210593272 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sufficient degree conditions for<i>k</i>-edge-connectedness of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The strongest monotone degree condition for \(n\)-connectedness of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5576241 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On Hamilton's ideals / rank | |||
Normal rank | |||
Latest revision as of 08:56, 28 July 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
