Related papers: A 1-parameter approach to links in a solid torus
We give a brief survey of some known results on intrinsically linked or knotted graphs.
Trotter and Erd\"os found conditions for when a directed $m \times n$ grid graph on a torus is Hamiltonian. We consider the analogous graphs on a two-holed torus, and study their Hamiltonicity. We find an $\mathcal{O}(n^4)$ algorithm to…
Laundry surfaces for closed braid diagrams are presented. It is shown that braid diagrams are characterized by linking matrices obtained by lifting cycles from these surfaces. Oriented link types are then characterized by equivalence…
Alexander's and Markov's theorems state that any link type in $R^3$ is represented by a closed braid and that such representations are related by some elementary operations called Markov moves. We generalize the notion of a braid to that in…
We consider linear slices of the space of Kleinian once-punctured torus groups; a linear slice is obtained by fixing the value of the trace of one of the generators. The linear slice for trace 2 is called the Maskit slice. We will show that…
We present the first parallel fixed-parameter algorithm for subgraph isomorphism in planar graphs, bounded-genus graphs, and, more generally, all minor-closed graphs of locally bounded treewidth. Our randomized low depth algorithm has a…
We say that a graph $G$ is $(2,m)$-linked if, for any distinct vertices $a_1,\ldots, a_m, b_1,b_2$ in $G$, there exist vertex disjoint connected subgraphs $A,B$ of $G$ such that $\{a_1, \ldots, a_m\}$ is contained in $A$ and $\{b_1,b_2\}$…
A complete Reidemeister characterisation of welded links is a long-standing open problem. We present a Reidemeister Theorem for a related class of four-dimensional links, solid ribbon torus links: immersed solid tori in R4 with only ribbon…
Every link in R^3 can be represented by a one-vertex ribbon graph. We prove a Markov type theorem on this subset of link diagrams.
This paper presents the novel `uniqueness tree' algorithm, as one possible method for determining whether two finite, undirected graphs are isomorphic. We prove that the algorithm has polynomial time complexity in the worst case, and that…
A differential geometric characterization of the braid-index of a link is found. After multiplication by 2pi, it equals the infimum of the sum of total curvature and total absolute torsion over holonomic representatives of the link. Upper…
For a simple graph $G$, the $3$-distance graph, $D_3(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $3$ in the graph $G$. For a connected graph $G$, we provide some conditions for…
Inspired by artistic practices such as beadwork and himmeli, we study the problem of threading a single string through a set of tubes, so that pulling the string forms a desired graph. More precisely, given a connected graph (where edges…
We say that a vertex $v$ in a connected graph $G$ is decisive if the numbers of walks from $v$ of each length determine the graph $G$ rooted at $v$ up to isomorphism among all connected rooted graphs with the same number of vertices. On the…
To each link $L$ in $S^3$ we associate a collection of certain labelled directed trees, called width trees. We interpret some classical and new topological link invariants in terms of these width trees and show how the geometric structure…
In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
Two virtual link diagrams are homotopic if one may be transformed into the other by a sequence of virtual Reidemeister moves, classical Reidemeister moves, and self crossing changes. We recall the pure virtual braid group. We then describe…
We will discuss a method for visual presentation of knotted surfaces in the four space, by examining a number and a position of its Morse's critical points. Using this method, we will investigate surface-knot with one critical point of…
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…