On Minimum Degree Implying That a Graph is H‐Linked (Q5426876)
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 5212471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9474913477897644
0 references
0.935090720653534
0 references
0.9131004214286804
0 references
0.9123469591140748
0 references
0.8822082281112671
0 references
