Related papers: Intersection graph and writhe polynomial

We compute lower bounds on the virtual crossing number and minimal surface genus of virtual knot diagrams from the arrow polynomial. In particular, we focus on several interesting examples.

It is shown that shift graphs can be realized as disjointness graphs of 1-intersecting curves in the plane. This implies that the latter class of graphs is not $\chi$-bounded.

We define counting and cocycle enhancement invariants of virtual knots using parity biquandles. These invariants are determined by pairs consisting of a biquandle 2-cocycle \phi^0 and a map \phi^1 with certain compatibility conditions…

We claimed that there is a polynomial algorithm to test if two graphs are isomorphic. But the algorithm is wrong. It only tests if the adjacency matrices of two graphs have the same eigenvalues. There is a counterexample of two…

The space writhe of a knot is a property of its three-dimensional embedding that contains information about its underlying topology, but the correspondence between space writhe and other topological invariants is not fully understood. We…

We define a family of virtual knots generalizing the classical twist knots. We develop a recursive formula for the Alexander polynomial $\Delta_0$ (as defined by Silver and Williams) of these virtual twist knots. These results are applied…

Multicrossings, which have previously been defined for classical knots and links, are extended to virtual knots and links. In particular, petal diagrams are shown to exist for all virtual knots.

We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…

We prove that if two knots are concordant, their involutive knot Floer complexes satisfy a certain type of stable equivalence.

It is shown that if a planar graph admits no non-constant bounded harmonic functions then the trajectories of two independent simple random walks intersect almost surely.

In this paper we introduce the notion of an unknotting index for virtual knots. We give some examples of computation by using writhe invariants, and discuss a relationship between the unknotting index and the virtual knot module. In…

In the present paper we construct a one-to-one correspondence between the set of graph-knots and the set of homotopy classes of looped graphs. Moreover, the graph-knot and the homotopy class constructed from a given knot are related with…

We introduce the 2-colour parity. It is a theory of parity for a large class of virtual links, defined using the interaction between orientations of the link components and a certain type of colouring. The 2-colour parity is an extension of…

We prove that there are intersection graphs of axis-aligned boxes in $\mathbb{R}^3$ and intersection graphs of straight lines in $\mathbb{R}^3$ that have arbitrarily large girth and chromatic number.

We extend some classical results of Bankwitz, Crowell, and Murasugi to the setting of virtual links. For instance, we show that an alternating virtual link is split if and only if it is visibly split, and that the Alexander polynomial of…

Virtual knot theory has experienced a lot of nice features that did not appear in classical knot theory, e.g., parity and picture-valued invariants. In the present paper we use virtual knot theory effects to construct new representations of…

A realization of a virtual link diagram is obtained by choosing over/under markings for each virtual crossing. Any realization can also be obtained from some representation of the virtual link. (A representation of a virtual link is a link…

We observe that any knot invariant extends to virtual knots. The isotopy classification problem for virtual knots is reduced to an algebraic problem formulated in terms of an algebra of arrow diagrams. We introduce a new notion of finite…

Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…

We use crossing parity to construct a generalization of biquandles for virtual knots which we call Parity Biquandles. These structures include all biquandles as a standard example referred to as the even parity biquandle. Additionally, we…