Intrinsic linking and knotting are arbitrarily complex in directed graphs (Q5035316)
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: Intrinsic linking and knotting are arbitrarily complex in directed graphs |
scientific article; zbMATH DE number 7477719
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Intrinsic linking and knotting are arbitrarily complex in directed graphs |
scientific article; zbMATH DE number 7477719 |
Statements
Intrinsic linking and knotting are arbitrarily complex in directed graphs (English)
0 references
21 February 2022
0 references
intrinsically knotted graph
0 references
intrinsically linked graph
0 references
directed graph
0 references
spatial graph
0 references
0.9036593
0 references
0 references
0 references
0.89470416
0 references
0 references
0.88868755
0 references
0.8850054
0 references
0.87513494
0 references
0 references
