Related papers: Colouring Isonemal Fabrics with more than two Colo…
Perfect colouring of isonemal fabrics by thin striping of warp and weft with more than two colours is examined. Examples of thin striping in all possible species with no redundancy and with redundant cells arranged as twills are given.…
Perfect colouring of isonemal fabrics by thin and thick striping of warp and weft with more than two colours is examined where the cells with warps and wefts of the same colour do not appear along diagonal lines (not twilly redundancy). In…
Perfect colouring of isonemal fabrics by thick striping of warp and weft and the closely related topic of isonemal prefabrics that fall apart are reconsidered and their relation further explored. The catalogue of isonemal prefabrics of…
Perfect colouring of isonemal fabrics by thin striping of warp and weft and the closely related topic of isonemal prefabrics that fall apart are reconsidered and their relation further explored. The catalogue of isonemal prefabrics that…
Multiple color stripes have been employed for structured light-based rapid range imaging to increase the number of uniquely identifiable stripes. The use of multiple color stripes poses two problems: (1) object surface color may disturb the…
This paper continues the refinement of Richard Roth's taxonomy of isonemal weaving designs through types 11--32 of the 39 in order to solve three problems for those designs: which designs exist in various sizes, which prefabrics can be…
Given a planar point set and an integer $k$, we wish to color the points with $k$ colors so that any axis-aligned strip containing enough points contains all colors. The goal is to bound the necessary size of such a strip, as a function of…
Arrangements of pseudolines are a widely studied generalization of line arrangements. They are defined as a finite family of infinite curves in the Euclidean plane, any two of which intersect at exactly one point. One can state various…
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…
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…
This paper refines Richard Roth's taxonomy of isonemal weaving designs through the final types 33--39 in order to complete the solution of three problems for those designs: which designs exist in various sizes, which prefabrics can be…
The coloring problem is studied in the paper for graph classes defined by two small forbidden induced subgraphs. We prove some sufficient conditions for effective solvability of the problem in such classes. As their corollary we determine…
Isonemal weaving designs, introduced into mathematical literature by Gr\"unbaum and Shephard, were classified into thirty-nine infinite sets and a small number of exceptions by Richard Roth. This paper refines Roth's taxonomy for the first…
In this paper, two open conjectures are disproved. One conjecture regards independent coverings of sparse partite graphs, whereas the other conjecture regards orthogonal colourings of tree graphs. A relation between independent coverings…
In this paper, we consider the problem of a star coloring. In general case the problems in NP-complete. We establish the star chromatic number for splitting graph of complete and complete bipartite graphs, as well of paths and cycles. Our…
Consider the following two ways to colour the vertices of a graph where the requirement that adjacent vertices get distinct colours is relaxed. A colouring has "defect" $d$ if each monochromatic component has maximum degree at most $d$. A…
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…
Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure.…
A vertex colouring of some graph is called perfect if each vertex of colour $i$ has exactly $a_{ij}$ neighbours of colour $j$. Being perfect imposes several restrictions on the colour incidence matrix $(a_{ij})$. We list several (old and…
For complete graphs and n-cubes bounds are found for the possible number of colours in an interval edge colourings.