The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable (Q266961)
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 6566342
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable |
scientific article; zbMATH DE number 6566342 |
Statements
The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable (English)
0 references
7 April 2016
0 references
competition graph
0 references
\((1, 2)\)-step competition graph
0 references
locally semicomplete digraph
0 references
local tournament
0 references
round-decomposable
0 references
0.93085146
0 references
0.9131872
0 references
0.90680015
0 references
0.90659904
0 references
0 references
0.8915724
0 references
0.88982123
0 references
0.8689941
0 references
