Related papers: Minimal crossing number implies minimal supporting…
We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all…
A parity is a labeling of the crossings of knot diagrams which is compatible with Reidemeister moves. We define the notion of parity for based matrices -- algebraic objects introduced by V. Turaev in his research of virtual strings. We…
Virtual index cocycle is the 1-cochain that counts virtual crossings in the arcs of a virtual link diagram. We show how this cocycle can be used to reformulate and unify some known invariants of virtual links.
We show that the genus problem for alternating knots with $n$ crossings has linear time complexity and is in Logspace$(n)$. Almost all alternating knots of given genus possess additional combinatorial structure, we call them standard. We…
The notion of chckerboard colorability for virtual links and abstract links is introduced. We study the Jones polynomials of virtual links and abstruct links. It is proved that a certain property of the Jones polynomials of classical links…
In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the…
The warping degree of an oriented knot diagram is the minimal number of crossing changes which are required to obtain a monotone knot diagram from the diagram. The minimal warping degree of a knot is the minimal value of the warping degree…
In this paper, we define some polynomial invariants for virtual knots and links. In the first part we use Manturov's parity axioms to obtain a new polynomial invariant of virtual knots. This invariant can be regarded as a generalization of…
The crossing number of a graph is the minimum number of crossings over all of its drawings on the plane. The Crossing Lemma, proved more than 40 years ago, is a tight lower bound on the crossing number of a graph in terms of the number of…
In this paper, we establish that the arc shift operation on a $n$-component virtual link diagram acts as an unknotting operation when the virtual link is $n$-homogeneous proper, aiding in the classification of \( n \)-component virtual…
This paper studies rotational virtual knot theory and its relationship with quantum link invariants. Every quantum link invariant for classical knots and links extends to an invariant of rotational virtual knots and links. The paper sets up…
For a link with zero determinants, a Z-coloring is defined as a generalization of Fox coloring. We call a link having a diagram which admits a non-trivial Z-coloring a Z-colorable link. The minimal coloring number of a Z-colorable link is…
In \cite{Kim} it is shown that knots in $S_{g} \times S^{1}$ can be presented by virtual diagrams with a decoration, so called, {\em double lines}. In this paper, we study the essential diagram for each knot in $S_{g} \times S^{1}$, which…
By adding or removing appropriate structures to Gauss diagram, one can create useful objects related to virtual links. In this paper few objects of this kind are studied: twisted virtual links generalizing virtual links; signed chord…
In interconnection networks, matching preclusion is a measure of robustness when there is a link failure. Let $G$ be a graph of even order. The matching preclusion number $mp(G)$ is defined as the minimum number of edges whose deletion…
Non-classical virtual knots may have non-isomorphic upper and lower quandles. We exploit this property to define the quandle difference invariant, which can detect non-classicality by comparing the numbers of homomorphisms into a finite…
We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…
In this paper, we show that a link which has a positive and almost alternating diagram is alternating, besides that a positive and non-alternating Montesinos link has an almost positive-alternating diagram.
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.
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A multi-crossing is a crossing where more than two strands meet at a single point, such that each strand bisects the…