A minimum degree condition forcing a digraph to be k-linked (Q3503449)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A minimum degree condition forcing a digraph to be k-linked |
scientific article |
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
