Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture (Q1850573)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Covering a strong digraph by -1 disjoint paths: A proof of Las Vergnas' conjecture |
scientific article; zbMATH DE number 1843798
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture |
scientific article; zbMATH DE number 1843798 |
Statements
Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture (English)
0 references
10 December 2002
0 references
stability number
0 references
independence number
0 references
partition
0 references
forest
0 references
paths
0 references
stable set
0 references
arborescence
0 references
0.82575923204422
0 references
0.8240032196044922
0 references
0.8122624158859253
0 references
0.8067428469657898
0 references
