Related papers: Three dimensions of knot coloring
We give lower bounds for the Gordian distance and the unknotting number of handlebody-knots by using Alexander biquandle colorings. We construct handlebody-knots with Gordian distance $n$ and unknotting number $n$ for any positive integer…
We calculate limits of the colored Jones polynomials of the figure-eight knot and conclude that in most cases they determine the volumes and the Chern--Simons invariants of the three-manifolds obtained by Dehn surgeries along it.
An edge-coloured cycle is $rainbow$ if all edges of the cycle have distinct colours. For $k\geq 1$, let $\mathcal{F}_{k}$ denote the family of all graphs with the property that any $k$ vertices lie on a cycle. For $G\in \mathcal{F}_{k}$, a…
Traditionally, knot theorists have considered projections of knots where there are two strands meeting at every crossing. A triple crossing is a crossing where three strands meet at a single point, such that each strand bisects the…
Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…
A G-coloured knot is a knot together with a representation of its knot group onto G. Two G-coloured knots are said to be rho-equivalent if they are related by surgery around unit framed unknots in the kernels of their colourings. The…
The list coloring problem is a variant of vertex coloring where a vertex may be colored only a color from a prescribed set. Several applications of vertex coloring are more appropriately modelled as instances of list coloring and thus we…
A coloring of a graph is an assignment of colors to its vertices such that adjacent vertices have different colors. Two colorings are equivalent if they induce the same partition of the vertex set into color classes. Let $\mathcal{A}(G)$ be…
The pair (K,r) consisting of a knot K and a surjective map r from the knot group onto a dihedral group is said to be a p-colored knot. D. Moskovich conjectured that for any odd prime p there are exactly p equivalence classes of p-colored…
In this work, we consider a number of problems defined on the triangular lattice with $n$ rows, which we will denote as $T_n$. Define a \textit{proper coloring} to be an assignment of colors to the points of $T_n$ such that no three points…
A (continuous) necklace is simply an interval of the real line colored measurably with some number of colors. A well-known application of the Borsuk-Ulam theorem asserts that every $k$-colored necklace can be fairly split by at most $k$…
Generalizing the notion of odd-sum colorings, a $\mathbb{Z}$-labeling of a graph $G$ is called a closed coloring with remainder $k\mod n$ if the closed neighborhood label sum of each vertex is congruent to $k\mod n$. If such colorings…
A vertex coloring of a graph $G$ is an assignment of colors to the vertices of $G$ such that every two adjacent vertices of $G$ have different colors. A coloring related property of a graphs is also an assignment of colors or labels to the…
In this paper, we consider minimum numbers of colors of knots for Dehn colorings. In particular, we will show that for any odd prime number $p$ and any Dehn $p$-colorable knot $K$, the minimum number of colors for $K$ is at least $\lfloor…
For a reduced alternating diagram of a knot with a prime determinant $p,$ the Kauffman-Harary conjecture states that every non-trivial Fox $p$-coloring of the knot assigns different colors to its arcs. In this paper, we prove a…
Call a colouring of a graph distinguishing if the only automorphism which preserves it is the identity. We investigate the role of the Axiom of Choice in the existence of certain proper or distinguishing colourings in both vertex and edge…
A fall coloring of a graph G is a proper coloring of G with k colors such that each vertex sees all k colors on its closed neighborhood. In this short note, we characterize all fall colorings of Kneser graphs of type KG(n,2).
An edge coloring of the n-vertex complete graph K_n is a Gallai coloring if it does not contain any rainbow triangle, that is, a triangle whose edges are colored with three distinct colors. We prove that the number of Gallai colorings of…
For complete graphs and n-cubes bounds are found for the possible number of colours in an interval edge colourings.
We investigate a class of 2-edge coloured bipartite graphs known as alternating signed bipartite graphs (ASBGs) that encode the information in alternating sign matrices. The central question is when a given bipartite graph admits an…