๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

More intrinsically knotted graphs

โœ Scribed by Joel Foisy


Publisher
John Wiley and Sons
Year
2006
Tongue
English
Weight
197 KB
Volume
54
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

โœฆ Synopsis


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


๐Ÿ“œ SIMILAR VOLUMES


Intrinsically knotted graphs
โœ Joel Foisy ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 100 KB

## 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

A newly recognized intrinsically knotted
โœ Joel Foisy ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 113 KB

## 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

Knot graphs
โœ Noble, S. D.; Welsh, D. J. A. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 148 KB

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

Dual graphs and knot invariants
โœ Magnhild Lien; William Watkins ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 159 KB