Intrinsically knotted graphs

DOI10.1002/JGT.10017MaRDI QIDQ3651177zbMATH OpenOpenAlexWikidataFDO

Authors Joel Foisy

Publication date 8 December 2009

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10017

zbMATH Keywords

complete graphknotted cyclespatial embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Recommendations

• Knots in certain spatial graphs
• KNOTTED HAMILTONIAN CYCLES IN LINEAR EMBEDDING OF K₇ INTO ℝ³
• Intrinsic knotting and linking of almost complete graphs
• More intrinsically knotted graphs
• Intrinsic knotting and linking of complete graphs

Cites work

• Knots and links in spatial graphs
• Knots in certain spatial graphs
• Sachs' linkless embedding conjecture

Cited in

(36)

• Knots in certain spatial graphs
• Intrinsic knotting and linking of complete graphs
• A new intrinsically knotted graph with 22 edges
• Counting links and knots in complete graphs
• Many, many more intrinsically knotted graphs
• Intrinsic linking and knotting in virtual spatial graphs
• Knots and links in spatial graphs: a survey
• Knots in spatial embeddings of the complete graph on four vertices
• The minor minimal intrinsically chiral graphs
• Intrinsically linked graphs with knotted components
• INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
• LINKING IN STRAIGHT-EDGE EMBEDDINGS OF K₇
• Triangle-Y exchanges on intrinsic knotting of almost complete and complete partite graphs
• GRAPHS WITH A KNOT OR 3-COMPONENT LINK IN EVERY SPATIAL EMBEDDING
• Improved lower bound for the number of knotted Hamiltonian cycles in spatial embeddings of complete graphs
• Intrinsic knotting and linking of almost complete graphs
• scientific article; zbMATH DE number 57260 (Why is no real title available?)
• scientific article; zbMATH DE number 125433 (Why is no real title available?)
• scientific article; zbMATH DE number 1160692 (Why is no real title available?)
• Intrinsically knotted and 4-linked directed graphs
• Recent developments in spatial graph theory
• Order nine MMIK graphs
• More intrinsically knotted graphs with 22 edges and the restoring method
• Plane curves in an immersed graph in \({\mathbb R}^{2}\)
• Intrinsic linking and knotting are arbitrarily complex in directed graphs
• Tree densities in sparse graph classes
• Capturing links in spatial complete graphs
• Intrinsic linking and knotting in tournaments
• Bipartite intrinsically knotted graphs with 22 edges
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS
• An algorithm for detecting intrinsically knotted graphs
• Linearly free graphs
• Constructions stemming from nonseparating planar graphs and their Colin de Verdière invariant
• Complete minors in complements of nonseparating planar graphs
• Dips at small sizes for topological graph obstruction sets
• Intrinsically knotted graphs and connected domination

This page was built for publication: Intrinsically knotted graphs

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