## Abstract In 1983, Conway and Gordon [J Graph Theory 7 (1983), 445β453] showed that every (tame) spatial embedding of __K__~7~, the complete graph on 7 vertices, contains a knotted cycle. In this paper, we adapt the methods of Conway and Gordon to show that __K__~3,3,1,1~ contains a knotted cycle
Knot graphs
β Scribed by Noble, S. D.; Welsh, D. J. A.
- Publisher
- John Wiley and Sons
- Year
- 2000
- Tongue
- English
- Weight
- 148 KB
- Volume
- 34
- Category
- Article
- ISSN
- 0364-9024
No coin nor oath required. For personal study only.
β¦ Synopsis
We consider the equivalence classes of graphs induced by the unsigned versions of the Reidemeister moves on knot diagrams. Any graph that is reducible by some finite sequence of these moves, to a graph with no edges, is called a knot graph. We show that the class of knot graphs strictly contains the set of delta-wye graphs. We prove that the dimension of the intersection of the cycle and cocycle spaces is an effective numerical invariant of these classes.
π SIMILAR VOLUMES
## Abstract We demonstrate four intrinsically knotted graphs that do not contain each other, nor any previously known intrinsically knotted graph, as a minor. Β© 2006 Wiley Periodicals, Inc. J Graph Theory 54: 115β124, 2007
This paper presents a knot theoretic approach to the study of molecular graphs. It provides examples of molecular knots and links as well as other topologically complex molecules. The paper discusses various topological problems and theorems which were motivated by questions in chemistry. Some of th
## Abstract In [Adams, 1994; The Knot Book], Colin Adams states as an open question whether removing a vertex and all edges incident to that vertex from an intrinsically knotted graph must yield an intrinsically linked graph. In this paper, we exhibit an intrinsically knotted graph for which there