Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture (Q1850573)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering a strong digraph by \(\alpha-1\) disjoint paths: A proof of Las Vergnas' conjecture |
scientific article |
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
