Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph (Q5244578)
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: Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph |
scientific article; zbMATH DE number 6420478
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph |
scientific article; zbMATH DE number 6420478 |
Statements
Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph (English)
0 references
27 March 2015
0 references
spatial graphs
0 references
intrinsically knotted graph
0 references
intrinsically linked graph
0 references
