A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (Q6041530)
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 7689997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs |
scientific article; zbMATH DE number 7689997 |
Statements
A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs (English)
0 references
31 May 2023
0 references
semicomplete digraphs
0 references
minimum semi-degree
0 references
disjoint path covers
0 references
0 references
0.90707546
0 references
0.8913043
0 references
0.8821776
0 references
0 references
0 references
0.86659795
0 references
0.8654758
0 references
0.8653128
0 references
