Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph (Q5244578): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4820380 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A newly recognized intrinsically knotted graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: TRIANGLE-Y EXCHANGES ON INTRINSIC KNOTTING OF ALMOST COMPLETE AND COMPLETE PARTITE GRAPHS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sachs' linkless embedding conjecture / rank | |||
Normal rank | |||
Revision as of 21:34, 9 July 2024
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
0 references
