Almost all string graphs are intersection graphs of plane convex sets (Q5116528)
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: Almost all string graphs are intersection graphs of plane convex sets |
scientific article; zbMATH DE number 7236472
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Almost all string graphs are intersection graphs of plane convex sets |
scientific article; zbMATH DE number 7236472 |
Statements
18 August 2020
0 references
string graph
0 references
intersection graph
0 references
plane convex set
0 references
0 references
Almost all string graphs are intersection graphs of plane convex sets (English)
0 references
0.9998486638069152
0 references
0.8039008975028992
0 references
0.8002246022224426
0 references
0.7964300513267517
0 references
