Tournaments whose indecomposability graph admits a vertex cover of size 2. (Q2829069)
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: Tournaments whose indecomposability graph admits a vertex cover of size 2. |
scientific article; zbMATH DE number 6644260
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tournaments whose indecomposability graph admits a vertex cover of size 2. |
scientific article; zbMATH DE number 6644260 |
Statements
26 October 2016
0 references
indecomposability graph
0 references
interval
0 references
indecomposable tournament
0 references
0.87635493
0 references
0.84943926
0 references
0.8486961
0 references
0.84530705
0 references
0.84201163
0 references
0.8419056
0 references
Tournaments whose indecomposability graph admits a vertex cover of size 2. (English)
0 references
