Related papers: A New Way to Tabulate Knots
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
We introduce and study the 1-planar packing problem: Given $k$ graphs with $n$ vertices $G_1, \dots, G_k$, find a 1-planar graph that contains the given graphs as edge-disjoint spanning subgraphs. We mainly focus on the case when each $G_i$…
Algorithm of construction of all knots, links with given number of crosses on diagram of knot, link is offered. This algorithm is based on simple proposition, that there is a representation of knot (link) as closure of braid with n threads…
We present a new characterization of $k$-trees based on their reduced clique graphs and $(k+1)$-line graphs, which are block graphs. We explore structural properties of these two classes, showing that the number of clique-trees of a…
The concordance orders of many algebraic order two knots of ten or fewer crossings have been heretofore unknown. We use Casson-Gordon invariants and twisted Alexander polynomials to find that, in all but one case, these knots do not have…
We provide a way to produce knots in $S^3$ from signed chord diagrams, and prove that every knot can be produced in this way. Using these diagrams, we generalize the fundamental theorem of finite type invariants. We also provide moves for…
The overlap graphs of subtrees in a tree (SOGs) generalise many other graphs classes with set representation characterisations. The complexity of recognising SOGs in open. The complexities of recognising many subclasses of SOGs are known.…
We initiate the study of classical knots through the homotopy class of the n-th evaluation map of the knot, which is the induced map on the compactified n-point configuration space. Sending a knot to its n-th evaluation map realizes the…
A strengthened version of Harborth's well-known conjecture -- known as Kleber's conjecture -- states that every planar graph admits a planar straight-line drawing where every edge has integer length and each vertex is restricted to the…
In 2003, Ozsv\'ath, Szab\'o, and Rasmussen introduced the $\tau$ invariant for knots, and in 2011, Sarkar published a computational shortcut for the $\tau$ invariant of knots that can be represented by diagonal grid diagrams. Previously,…
A $k$-plane tree is a plane tree whose vertices are assigned labels between $1$ and $k$ in such a way that the sum of the labels along any edge is no greater than $k+1$. These trees are known to be related to $(k+1)$-ary trees, and they are…
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…
Given a finite planar graph, a grove is a spanning forest in which every component tree contains one or more of a specified set of vertices (called nodes) on the outer face. For the uniform measure on groves, we compute the probabilities of…
This paper is an exploration of simple four-regular graphs in the plane (i.e. loopless and with no more than one edge between any two nodes). Such graphs are fundamental to the theory of knots and links in three dimensional space, and their…
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…
A tree with at most $k$ leaves is called a $k$-ended tree. A spanning 2-ended tree is a Hamilton path. A Hamilton cycle can be considered as a spanning 1-ended tree. The earliest result concerning spanning trees with few leaves states that…
The alternating knots, links and twists projected on the $S_2$ sphere were identified with the phase space of a Hamiltonian dynamic system of one degree of freedom. The saddles of the system correspond to the crossings, the edges correspond…
This paper provides the complete table of prime knot projections with their mirror images, without redundancy, up to eight double points systematically thorough a finite procedure by flypes. In this paper, we show how to tabulate the knot…
In this paper, we study a geometric/topological measure of knots and links called the nullification number. The nullification of knots/links is believed to be biologically relevant. For example, in DNA topology, one can intuitively regard…
A special class of braids, called woven, is introduced and it is shown that every conjugation class of the braid group contains woven braids. In consequence, links can be presented as plats or closures of woven braids. Restricting on knots,…