Related papers: Color evolution of 2 -> 3 processes
The asymmetric coloring number of a graph is the minimum number of colors needed to color its vertices, so that no non-trivial automorphism preserves the color classes. We investigate the asymmetric coloring number of graphs that are…
A coloring of a tree is convex if the vertices that pertain to any color induce a connected subtree; a partial coloring (which assigns colors to some of the vertices) is convex if it can be completed to a convex (total) coloring. Convex…
In this paper, we first prove that if the edges of $K_{2m}$ are properly colored by $2m-1$ colors in such a way that any two colors induce a 2-factor of which each component is a 4-cycle, then $K_{2m}$ can be decomposed into $m$ isomorphic…
A theoretical study of cell evolution is presented here. By using a toolbox containing an intracellular catalytic reaction network model and a mutation-selection process, four distinct phases of self-organization were unveiled. First, the…
Reconstruction of images corrupted by noise is an important problem in Image Analysis. In the standard Bayesian approach the unknown original image is assumed to be a realization of a Markov random field on a finite two dimensional finite…
A good deal of research has been done and published on coloring of the vertices of graphs for several years while studying of the excellent work of those maestros, we get inspire to work on the vertex coloring of graphs in case of a…
Consider a multitype coalescent process in which each block has a colour in $\{1,\ldots,d\}$. Individual blocks may change colour, and some number of blocks of various colours may merge to form a new block of some colour. We show that if…
While every plane triangulation is colourable with three or four colours, Heawood showed that a plane triangulation is 3-colourable if and only if every vertex has even degree. In $d \geq 3$ dimensions, however, every $k \geq d+1$ may occur…
We study the number of monochromatic solution to linear equation in $\{1,\dots,n\}$ when we color the set by at least three colors. We consider the $r$-commonness for $r\geq 3$ of linear equation with odd number of terms, and we also prove…
Evolution of the reduced density matrix for a subsystem is studied to determine deviations from its Markov character for a system consisting of a closed chain of $N$ oscillators with one of them serving as a subsystem. The dependence on $N$…
Basic phenomenology of human color vision has been widely taken as an inspiration to devise explicit color correction algorithms. The behavior of these models in terms of significative image features (such as contrast and dispersion) can be…
We produce an edge-coloring of the complete 3-uniform hypergraph on n vertices with $e^{O(\sqrt {log log n})}$ colors such that the edges spanned by every set of five vertices receive at least three distinct colors. This answers the first…
The production of high-quality 2D animation is highly labor-intensive process, as animators are currently required to draw and color a large number of frames by hand. We present SketchColour, the first sketch-to-colour pipeline for 2D…
We consider a Moran model with recombination in a haploid population of size $N$. At each birth event, with probability $1-\rho_N R$ the offspring copies one parent's chromosome, and with probability $\rho_N R$ she inherits a chromosome…
We give an explicit construction of the generating set of a colored operad that implements theta theory in the mathematical model of Minimalism in generative linguistics, in the form of a coloring algorithm for syntactic objects. We show…
In this paper, we settle the open complexity status of interval constrained coloring with a fixed number of colors. We prove that the problem is already NP-complete if the number of different colors is 3. Previously, it has only been known…
The evolution of complexity has been a central theme for Biology [2] and Artificial Life research [1]. It is generally agreed that complexity has increased in our universe, giving way to life, multi-cellularity, societies, and systems of…
Lens modeling of resolved image data has advanced rapidly over the past two decades. More recently pixel-based approaches, wherein the source is reconstructed on an irregular or adaptive grid, have become popular. Generally, the source…
Learning color mixing is difficult for novice painters. In order to support novice painters in learning color mixing, we propose a prediction model for semitransparent pigment mixtures and use its prediction results to create a Smart…
A conjecture of Erd\H{o}s, Graham, Montgomery, Rothschild, Spencer and Straus states that, with the exception of equilateral triangles, any two-coloring of the plane will have a monochromatic congruent copy of every three-point…