More intrinsically knotted graphs with 22 edges and the restoring method

DOI10.1142/S0218216518500591zbMath1403.57006arXiv1708.03925OpenAlexW2963258909MaRDI QIDQ4684558

Hyoungjun Kim, Thomas W. Mattman, Seungsang Oh

Publication date: 1 October 2018

Published in: Journal of Knot Theory and Its Ramifications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.03925

zbMATH Keywords

graph embeddingintrinsically knotted

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (1)

Bipartite intrinsically knotted graphs with 23 edges

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs of 20 edges are 2-apex, hence unknotted
• On intrinsically knotted or completely 3-linked graphs
• Graph minors. XX: Wagner's conjecture
• Exactly fourteen intrinsically knotted graphs have 21 edges
• A new intrinsically knotted graph with 22 edges
• Many, many more intrinsically knotted graphs
• Primitive spatial graphs and graph minors
• Graphs on 21 edges that are not 2-apex
• Knots and links in spatial graphs
• INTRINSICALLY KNOTTED GRAPHS HAVE AT LEAST 21 EDGES
• Intrinsically knotted graphs
• Bipartite Intrinsically Knotted Graphs with 22 Edges
• SOME RESULTS ON INTRINSICALLY KNOTTED GRAPHS

This page was built for publication: More intrinsically knotted graphs with 22 edges and the restoring method