Topics
algorithmMusic genre
Abstract. We describe an algorithm that recognizes some (perhaps all) in-trinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica pro-gram, has already been used in [6] to greatly expand the list of known minor minimal IK graphs, and to find knotless embeddings for some graphs that had previously resisted attempts to classify them as IK or non-IK. 1
An analog to intrinsic linking, intrinsic even linking, is explored in the first half of this paper....
A graph is intrinsically knotted (IK) if for every embedding of the graph there exists a knotted cyc...
AbstractWe address the following unknotting conjecture for graphs. If G is a planar graph embedded i...
In the field of topology, intrinsically knotted graphs are rare graphs in which all embeddings conta...
We demonstrate four intrinsically knotted graphs that do not con-tain each other, nor any previously...
Abstract. We list more than 200 new examples of minor minimal intrinsically knotted graphs and descr...
available for noncommercial, educational purposes, provided that this copyright statement appears on...
In the field of topology, a graph is a set of vertices with certain vertices connected to each other...
Our research focused on two questions in graph and knot theory. Our first question addressed the com...
We design a fast algorithm for computing the fundamental group of the complement to any knotted poly...
A graph is intrinsically knotted if there exists a knotted cycle in every spatial embedding of the g...
A graph is intrinsically knotted if there exists a knotted cycle in every spatial embedding of the g...
An analog to intrinsic linking, intrinsic even linking, is explored in the first half of this paper....
Knot theory, as traditionally studied, asks whether or not a loop of string is knotted. That is, ca...
Knot theory, as traditionally studied, asks whether or not a loop of string is knotted. That is, ca...
An analog to intrinsic linking, intrinsic even linking, is explored in the first half of this paper....
A graph is intrinsically knotted (IK) if for every embedding of the graph there exists a knotted cyc...
AbstractWe address the following unknotting conjecture for graphs. If G is a planar graph embedded i...
In the field of topology, intrinsically knotted graphs are rare graphs in which all embeddings conta...
We demonstrate four intrinsically knotted graphs that do not con-tain each other, nor any previously...
Abstract. We list more than 200 new examples of minor minimal intrinsically knotted graphs and descr...
available for noncommercial, educational purposes, provided that this copyright statement appears on...
In the field of topology, a graph is a set of vertices with certain vertices connected to each other...
Our research focused on two questions in graph and knot theory. Our first question addressed the com...
We design a fast algorithm for computing the fundamental group of the complement to any knotted poly...
A graph is intrinsically knotted if there exists a knotted cycle in every spatial embedding of the g...
A graph is intrinsically knotted if there exists a knotted cycle in every spatial embedding of the g...
An analog to intrinsic linking, intrinsic even linking, is explored in the first half of this paper....
Knot theory, as traditionally studied, asks whether or not a loop of string is knotted. That is, ca...
Knot theory, as traditionally studied, asks whether or not a loop of string is knotted. That is, ca...
An analog to intrinsic linking, intrinsic even linking, is explored in the first half of this paper....
A graph is intrinsically knotted (IK) if for every embedding of the graph there exists a knotted cyc...
AbstractWe address the following unknotting conjecture for graphs. If G is a planar graph embedded i...
Add to ORKG