Related papers: Colouring Isonemal Fabrics with more than two Colo…
Perfect colouring of isonemal fabrics by thin and thick striping of warp and weft with more than two colours is introduced. Conditions that prevent perfect colouring by striping are derived, and it is shown that avoiding them is sufficient…
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…
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…
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…
This expository paper describes how the knot invariant Fox coloring can be applied to tangles.
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…
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…
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…
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…
Alon et al. introduced the concept of non-repetitive colourings of graphs. Here we address some questions regarding non-repetitive colourings of planar graphs. Specifically, we show that the faces of any outerplanar map can be…
An interval edge t-coloring of a graph G is a proper edge coloring of G with colors 1,2...,t such that at least one edge of G is colored by color i,i=1,2...,t, and the edges incident with each vertex v are colored by d_{G}(v) consecutive…
We consider a certain tiling problem of a planar region in which there are no long horizontal or vertical strips consisting of copies of the same tile. Intuitively speaking, we would like to create a dappled pattern with two or more kinds…
Triangulation graph staining is sufficient for planar graph staining. This article will focus on triangulation and the nature of the color change channel of the staining tool. By construction, the four colors of the vertex are converted…
It is well known that any set of n intervals in $\mathbb{R}^1$ admits a non-monochromatic coloring with two colors and a conflict-free coloring with three colors. We investigate generalizations of this result to colorings of objects in more…
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…
A random number of items each independently marked with one of a collection of colours gives rise to the multinomial marking, which generalises binomial thinning. A multivariate version, where previously marked items are then re-marked, has…
Given a graph G, a colouring is an assignment of colours to the vertices of G so that no two adjacent vertices are coloured the same. If all colour classes have size at most t, then we call the colouring t-bounded, and the t-bounded…