On linking of Hamiltonian pairs of cycles in spatial graphs

MaRDI QIDQ890821zbMATH OpenFDO

Authors Andrei Vesnin, A. V. Litvintseva

Publication date 16 November 2015

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL http://semr.math.nsc.ru/v7/p383-393.pdf

zbMATH Keywords

Hamiltonian cycleknotlinkspatial graph

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Capturing links in spatial complete graphs
• Knotted Hamiltonian cycles in spatial embeddings of complete graphs
• Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs
• Improved lower bound for the number of knotted Hamiltonian cycles in spatial embeddings of complete graphs
• Knots and links in certain spatial complete graphs

Cited in

(5)

• On Hamiltonian graphs arising from spatial orders of chromosomes of even number
• Knotted Hamiltonian cycles in spatial embeddings of complete graphs
• Capturing links in spatial complete graphs
• Generalization of the Conway-Gordon theorem and intrinsic linking on complete graphs
• Site-specific Gordian distances of spatial graphs

This page was built for publication: On linking of Hamiltonian pairs of cycles in spatial graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q890821)