相关论文: Perfect colourings of isonemal fabrics by thin str…
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 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 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…
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…
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…
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…
A mechanism of perfect plasticity under low homological temperatures has been suggested. According to this mechanism, the phenomenon under study is of critical nature. It connects with percolation transition in the net of grain boundaries…
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 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)$…
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…
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…
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…
The list coloring problem is a variation of the classical vertex coloring problem, extensively studied in recent years, where each vertex has a restricted list of allowed colors, and having some variations as the $(\gamma,\mu)$-coloring,…
We list all perfect colorings of $Z^2$ by 9 or less colors. Keywords: perfect colorings, equitable partitions
We study the perfect matching reconfiguration problem: Given two perfect matchings of a graph, is there a sequence of flip operations that transforms one into the other? Here, a flip operation exchanges the edges in an alternating cycle of…
We compute all isomorphism classes of simplicial arrangements in the real projective plane with up to 27 lines. It turns out that Gr\"unbaums catalogue is complete up to 27 lines except for four new arrangements with 22, 23, 24, 25 lines,…