相关论文: The Minimal Coloring Number Of Any Non-splittable …

The minimal coloring number of a $\mathbb{Z}$-colorable link is the minimal number of colors for non-trivial $\mathbb{Z}$-colorings on diagrams of the link. In this paper, we show that the minimal coloring number of any non-splittable…

It was shown that any $\mathbb{Z}$-colorable link has a diagram which admits a non-trivial $\mathbb{Z}$-coloring with at most four colors. In this paper, we consider minimal numbers of colors for non-trivial $\mathbb{Z}$-colorings on…

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…

We determine the minimal number of colors for non-trivial $\mathbb{Z}$-colorings on the standard minimal diagrams of $\mathbb{Z}$-colorable torus links. Also included are complete classifications of such $\mathbb{Z}$-colorings and of such…

We show that the minimal number of colors for all effective $n$-colorings of a link with non-zero determinant is at least $1+\log_2 n$.

This article concerns exact results on the minimum number of colors of a Fox coloring over the integers modulo r, of a link with non-null determinant. Specifically, we prove that whenever the least prime divisor of the determinant of such a…

The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…

Relations will be described between the quandle cocycle invariant and the minimal number of colors used for non-trivial Fox colorings of knots and links. In particular, a lower bound for the minimal number is given in terms of the quandle…

We improve the lower bound for the minimum number of colors for linear Alexander quandle colorings of a knot given in Theorem 1.2 of Colorings beyond Fox: The other linear Alexander quandles (Linear Algebra and its Applications, Vol. 548,…

Let G be an n-vertex graph with list-chromatic number $\chi_\ell$. Suppose each vertex of G is assigned a list of t colors. Albertson, Grossman, and Haas conjecture that at least $t n / {\chi_\ell}$ vertices can be colored from these lists.…

In links with two components there are three different types of crossings: self-crossings in the first component, self crossings in the second component, and crossings between components. In this paper we examine the minimum number of…

The splitting number of a link is the minimum number of crossing changes between distinct components that is required to convert the link into a split link. We provide a bound on the splitting number in terms of the four-genus of related…

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…

A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same…

For each odd prime p, and for each non-split link admitting non-trivial p-colorings, we prove that the maximum number of Fox colors is p. We also prove that we can assemble a non-trivial p-coloring with any number of colors, from the…

We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the…

We prove that any $11$-colorable knot is presented by an $11$-colored diagram where exactly five colors of eleven are assigned to the arcs. The number five is the minimum for all non-trivially $11$-colored diagrams of the knot. We also…

A graph \( G \) is said to be (vertex) non-repetitively colored if no simple path in \( G \) has a sequence of vertex colors that forms a repetition. Formally, a coloring \( c: V(G) \to \{1, 2, \dots, k\} \) is non-repetitive if, for every…

In this paper we first investigate minimal sufficient sets of colors for p=11 and 13. For odd prime p and any p-colorable link L with non-zero determinant, we give alternative proofs of mincol_p L \geq 5 for p \geq 11 and mincol_p L \geq 6…

We consider the number of colors for the colorings of links by the symmetric group $S_3$ of degree $3$. For knots, such a coloring corresponds to a Fox 3-coloring, and thus the number of colors must be 1 or 3. However, for links, there are…