Related papers: Counting perfect colourings of plane regular tilin…
We get a quite maximal version of the colouring property $Pr_1$ by proving $Pr_1(\lambda,\lambda,\lambda,\theta)$ when $\lambda = \partial^+, \partial > \theta$ are regular cardinals.
We study the problem of consistent and homogeneous colourings for increasing families of dyadic intervals. We determine when this problem can be solved and when not.
In this paper, perfect k-orthogonal colourings of tensor graphs are studied. First, the problem of determining if a given graph has a perfect 2-orthogonal colouring is reformulated as a tensor subgraph problem. Then, it is shown that if two…
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…
Coloured graphical models are Gaussian statistical models determined by an undirected coloured graph. These models can be described by linear spaces of symmetric matrices. We outline a relationship between the symmetries of the graph and…
We address the problem of finding harmonic colors, this problem has many applications, from fashion to industrial design. In order to solve this problem we consider that colors follow normal distributions in tone (chroma and lightness) and…
In the perfect tiling problem, we aim to cover the vertices of a hypergraph~$G$ with pairwise vertex-disjoint copies of a hypergraph $F$. There are three essentially necessary conditions for such a perfect tiling, which correspond to…
A group-theoretical approach to the construction of quasiperiodic tilings of a Euclidean plane, possessing five-fold symmetry, is applied. Of the infinitely many of variants of quasiperiodic partitions of the plane, possessing the dihedral…
The coincidence problem for planar patterns with $N$-fold symmetry is considered. For the N-fold symmetric module with $N<46$, all isometries of the plane are classified that result in coincidences of finite index. This is done by…
It has been common knowledge since 1950 that seven colours can be assigned to tiles of an infinite honeycomb with cells of unit diameter such that no two tiles of the same colour are closer than $d(7)=\frac{\sqrt{7}}{2}$ apart. Various…
A coloring of vertices of a given graph is called perfect if the color structure of each ball of radius $1$ in the graph depends only on the color of the ball center. Let $n$ be a positive integer. We consider a lexicographic product of the…
We show that if a coloring of the plane has the properties that any two points at distance one are colored differently and the plane is partitioned into uniformly colored triangles under certain conditions, then it requires at least seven…
We list all perfect colorings of $Z^2$ by 9 or less colors. Keywords: perfect colorings, equitable partitions
We show, without using the Four Color Theorem, that for each planar triangulation, the number of its proper vertex colorings by 4 colors is a determinant and thus can be calculated in a polynomial time. In particular, we can efficiently…
Let $G$ be the unit distance graph in the plane. A well-known problem in combinatorial geometry is that of determining the chromatic number of $G$. It is known that $4\le \chi(G)\le 7$. The upper bound of 7 is obtained using tilings of the…
A well-studied concept is that of the total chromatic number. A proper total colouring of a graph is a colouring of both vertices and edges so that every pair of adjacent vertices receive different colours, every pair of adjacent edges…
Tiling models are classical statistical models in which different geometric shapes, the tiles, are packed together such that they cover space completely. In this paper we discuss a class of two-dimensional tiling models in which the tiles…
Perfect colorings (equitable partitions) of graphs are extensively studied, while the same concept for hypergraphs attracts much less attention. The aim of this paper is to develop basic notions and properties of perfect colorings for…
A total coloring of a graph $G = (V, E)$ is an assignment of colors to vertices and edges such that neither two adjacent vertices nor two incident edges get the same color, and, for each edge, the end-points and the edge itself receive…
Two colourings of a graph are orthogonal if they have the property that when two vertices are coloured with the same colour in one colouring, then those vertices receive distinct colours in the other colouring. In this paper, orthogonal…