Advanced search

Browse by subject

Browse by provider

Browse by language

Content Details
Normal View
CIP View

Deleting an edge of a 3-cycle in an intr...

Naimi, Ramin...

Free

Share this content

Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph by Naimi, Ramin ( Author )

Content Provider	Lemonjar Open Access
Publisher	Australian National University
Publication Date	04-08-2023
Summary	We show that deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph.
ISBN	-
Item Type	Article
File Type	pdf
File Size	29.34 KB
Language	English
Subjects	-
Unlimited	MYR 0.01
Total read	-
URL	http://arxiv.org/abs/1407.0297

Citation

Review the full bibliography data and make any necessary corrections before using. Always consult your library resources for the exact formatting and punctuation guidelines.

AMA 11th EditionReferences

Naimi, Ramin. Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph. Australian National University. August 04, 2023. Accessed August 14, 2025. https://online.provdatabase.com/cite/11006

APA 7th EditionReferences

Naimi, Ramin. (2023). Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph. Australian National University. https://online.provdatabase.com/cite/11006

Chicago 17th EditionReferences

Naimi, Ramin. Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph. Australian National University. 2023. https://online.provdatabase.com/cite/11006

HarvardReferences

Naimi, Ramin. (2023). Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph. [Online]. Australian National University. Available from: https://online.provdatabase.com/cite/11006. (Accessed 14 August 2025).

Harvard AustraliaReferences

Naimi, Ramin, 2023, Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph, Australian National University, viewed 14 August 2025, <https://online.provdatabase.com/cite/11006>

MLA 9th EditionWorks Cited

Naimi, Ramin. Deleting an edge of a 3-cycle in an intrinsically knotted graph gives an intrinsically linked graph. Australian National University, 2023. PROV Database, https://online.provdatabase.com/cite/11006.

Share this eBook