A minimum degree condition forcing a digraph to be k-linked (Q3503449)
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 5284880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minimum degree condition forcing a digraph to be k-linked |
scientific article; zbMATH DE number 5284880 |
Statements
A minimum degree condition forcing a digraph to be k-linked (English)
0 references
5 June 2008
0 references
digraphs
0 references
linkedness
0 references
minimum degree
0 references
0.9653691649436952
0 references
0.8626117706298828
0 references
0.8462664484977722
0 references
0.8309691548347473
0 references
0.8291321992874146
0 references
