On Minimum Degree Implying That a Graph is H‐Linked (Q5426876): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/050624662 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1996975178 / rank | |||
Normal rank | |||
Latest revision as of 19:10, 19 March 2024
scientific article; zbMATH DE number 5212471
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Minimum Degree Implying That a Graph is H‐Linked |
scientific article; zbMATH DE number 5212471 |
Statements
On Minimum Degree Implying That a Graph is H‐Linked (English)
0 references
16 November 2007
0 references
Minimum degree
0 references
connectivity
0 references
\(k\)-linked
0 references
\(H\)-linked
0 references
