Related papers: Perfect Colourings of Isonemal Fabrics by Thick St…
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…
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 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…
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 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…
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…
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 perfect coloring (equivalent concepts are equitable partition and partition design) of a graph $G$ is a function $f$ from the set of vertices onto some finite set (of colors) such that every node of color $i$ has exactly $S(i,j)$…
A coloring of a planar semiregular tiling $\mathcal{T}$ is an assignment of a unique color to each tile of $\mathcal{T}$. If $G$ is the symmetry group of $\mathcal{T}$, we say that the coloring is perfect if every element of $G$ induces a…
If $G$ is the symmetry group of an uncolored pattern then a coloring of the pattern is semiperfect if the associated color group $H$ is a subgroup of $G$ of index 2. We give results on how to identify and enumerate all inequivalent…
A vertex colouring of some graph is called perfect if each vertex of colour $i$ has the same number $a_{ij}$ of neighbours of colour $j$. Here we determine all perfect colourings of the edge graphs of the hypercube in dimensions 4 and 5 by…
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…
A totally silver coloring of a graph G is a k--coloring of G such that for every vertex v \in V(G), each color appears exactly once on N[v], the closed neighborhood of v. A totally silver graph is a graph which admits a totally silver…
We introduce a new graph invariant that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings. We study the relations with…
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…
We consider the problem of existence of perfect $2$-colorings (equitable $2$-partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence. Next we…
We define a perfect coloring of a graph $G$ as a proper coloring of $G$ such that every connected induced subgraph $H$ of $G$ uses exactly $\omega(H)$ many colors where $\omega(H)$ is the clique number of $H$. A graph is perfectly colorable…
A textile fabric consists of countless parallel vertical yarns (warps) and horizontal yarns (wefts). While common looms can weave repetitive patterns, Jacquard looms can weave the patterns without repetition restrictions. A pattern in which…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…