Related papers: Equivalence Classes of Colorings
A connected graph $G$, of order two or more, is matching covered if each edge lies in some \pema. The tight cut decomposition of a matching covered graph $G$ yields a list of bricks and braces; as per a theorem of Lov{\'a}sz~\cite{lova87},…
To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism…
A first step in investigating colour symmetries of periodic and nonperiodic patterns is determining the number of colours which allow perfect colourings of the pattern under consideration. A perfect colouring is one where each symmetry of…
A family of sets in the plane is simple if the intersection of its any subfamily is arc-connected, and it is pierced by a line $L$ if the intersection of its any member with $L$ is a nonempty segment. It is proved that the intersection…
The relationship between the coincidence indices of a lattice $\Gamma_1$ and a sublattice $\Gamma_2$ of $\Gamma_1$ is examined via the colouring of $\Gamma_1$ that is obtained by assigning a unique colour to each coset of $\Gamma_2$. In…
A structure $\mathcal{A}=\left(A;E_i\right)_{i\in n}$ where each $E_i$ is an equivalence relation on $A$ is called an $n$-grid if any two equivalence classes coming from distinct $E_i$'s intersect in a finite set. A function $\chi: A \to n$…
We define two classes of colorings that have odd or even chirality on hexagonal lattices. This parity is an invariant in the dynamics of all loops, and explains why standard Monte-Carlo algorithms are nonergodic. We argue that adding the…
We classify modules and rings with some specific properties of their intersection graphs. In particular, we describe rings with infinite intersection graphs containing maximal left ideals of finite degree. This answers a question raised in…
The combinatorial approach to knot theory treats knots as diagrams modulo Reidemeister moves. Many constructions of knot invariants (e.g., index polynomials, quandle colorings, etc.) use elements of diagrams such as arcs and crossings by…
We introduce moduli spaces of colored graphs, defined as spaces of non-degenerate metrics on certain families of edge-colored graphs. Apart from fixing the rank and number of legs these families are determined by various conditions on the…
For a connected graph, we define the proper-walk connection number as the minimum number of colors needed to color the edges of a graph so that there is a walk between every pair of vertices without two consecutive edges having the same…
Coloured Alexander polynomials form a sequence of non-semisimple quantum invariants coming from the representation theory of the quantum group $U_q(sl(2))$ at roots of unity. This sequence recovers the original Alexander polynomial as the…
A \emph{Kempe chain} on colors $a$ and $b$ is a component of the subgraph induced by colors $a$ and $b$. A \emph{Kempe change} is the operation of interchanging the colors of some Kempe chain. For a list-assignment $L$ and an $L$-coloring…
A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…
In this paper, we consider the family of pattern-replacement equivalence relations referred to as the "indices and values adjacent" case. Each such equivalence is determined by a partition $P$ of a subset of $S_c$ for some $c$. In 2010,…
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…
In complex networks the degrees of adjacent nodes may often appear dependent -- which presents a modelling challenge. We present a working framework for studying networks with an arbitrary joint distribution for the degrees of adjacent…
We describe a simple homological test for obstructions to graph colorings. The main idea is to combine the framework of Hom-complexes with the following general fact: an arbitrary Z_2-space has nontrivial homology with Z_2-coefficients in…
For graphs $G$ and $H$, an {\em $H$-colouring} of $G$ (or {\em homomorphism} from $G$ to $H$) is a function from the vertices of $G$ to the vertices of $H$ that preserves adjacency. $H$-colourings generalize such graph theory notions as…
We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…