Related papers: A New Polynomial for Checkerboard-Colorable 4-Vale…
In this note we study a certain graph polynomial arising from a special recursion. This recursion is a member of a family of four recursions where the other three recursions belong to the chromatic polynomial, the modified matching…
We establish closed-form expansions for the number of colorings of a path or cycle on n vertices with colors from 1,...,x such that adjacent vertices are colored differently or with colors from y+1,...x.
We give a new construction of the one-variable Alexander polynomial of an oriented knot or link, and show that it generalizes to a vector valued invariant of oriented tangles.
In the present paper we give an explicit formula which allows us immediately to describe a unique Gauss circuit on a framed 4-valent graph (a graph with a structure of opposite edges) from an arbitrary Euler tour on the graph whenever the…
In this note we show that any embedded graph has a checkerboard colourable twisted dual and any Eulerian embedded graph has a checkerboard colourable partial Petrial, answering questions posed by Ellis-Monaghan and Moffatt. The proofs are…
The representation is essentially the same as that given by J.P.Nagle in J. Comb. Theory (B), 1971, 10:1, 42--59. The distinction is in the definition of the weighting function via the number of flows. This new definition allows one to…
The Euler characteristic of the link of a real algebraic variety is an interesting topological invariant in order to discuss local topological properties. We prove in the paper that an invariant stronger than the Euler Characteristic is…
In order to apply quantum topology methods to nonplanar graphs, we define a planar diagram category that describes the local topology of embeddings of graphs into surfaces. These \emph{virtual graphs} are a categorical interpretation of…
We extend the Kamada-Miyazawa polynomial to virtual singular links, which is valued in $\mathbb{Z}[A^2, A^{-2}, h]$. The decomposition of the resulting polynomial into two components, one in $\mathbb{Z}[A^2, A^{-2}]$ and the other in…
This paper discusses ways to categorify chromatic, dichromatic and Penrose polynomials, including categorifications of integer evaluations of chromatic polynomials. We show that with an appropriate choice of variables the coefficients of…
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an…
We give a congruence relating a one variable specialization of the two variable Kauffman polynomial of any periodic link to that of its mirror image. Consequently, we obtain a new and simple criterion for periodicity of links.
It is well a known and fundamental result that the Jones polynomial can be expressed as Potts and vertex partition functions of signed plane graphs. Here we consider constructions of the Jones polynomial as state models of unsigned graphs…
In this note we define a polynomial invariant for colored links by a skein relation. It specializes to the Jones polynomial for classical links.
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…
Recently, Chmutov introduced the partial duality of ribbon graphs, which can be regarded as a generalization of the classical Euler-Poincar\'e duality. The partial-dual genus polynomial $^\partial\varepsilon_G(z)$ is an enumeration of the…
We define a generalization of virtual links to arbitrary dimensions by extending the geometric definition due to Carter et al. We show that many homotopy type invariants for classical links extend to invariants of virtual links. We also…
Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane…
We introduce a new equivalence relation on decorated ribbon graphs, and show that its equivalence classes directly correspond to virtual links. We demonstrate how this correspondence can be used to convert any invariant of virtual links…