Results 51 to 60 of about 1,114,847 (341)
Discussiones Mathematicae Graph Theory, 2015 Given a coloring of the vertices, we say subgraph H is monochromatic if every vertex of H is assigned the same color, and rainbow if no pair of vertices of H are assigned the same color. Given a graph G and a graph F, we define an F-WORM coloring of G as
Goddard Wayne, Wash Kirsti, Xu Honghai
doaj +1 more source
Nanostructured Color Filters: A Review of Recent Developments
Nanomaterials, 2020 Color plays an important role in human life: without it life would be dull and monochromatic. Printing color with distinct characteristics, like hue, brightness and saturation, and high resolution, are the main characteristic of image sensing devices.
Ayesha Shaukat +2 more
doaj +1 more source
Variability and systematic differences in normal, protan and deutan color naming
Frontiers in Psychology, 2014 Congenital color vision deficients generally demonstrate difficulties in color naming tasks. In our study we investigated the color naming properties and uncertainties of a relatively large group of red-green color vision deficients using quasi ...
BALAZS VINCE NAGY +4 more
doaj +1 more source
List vertex arboricity of planar graphs without 5-cycles intersecting with 6-cycles
AIMS Mathematics, 2021 The vertex arboricity a(G) of a graph G is the minimum number of colors required to color the vertices of G such that no cycle is monochromatic. The list vertex arboricity al(G) is the list version of this concept.
Yanping Yang , Yang Wang, Juan Liu
doaj +1 more source
Video-to-Video Dynamic Super-Resolution for Grayscale and Color Sequences
EURASIP Journal on Advances in Signal Processing, 2006 We address the dynamic super-resolution (SR) problem of reconstructing a high-quality set of monochromatic or color super-resolved images from low-quality monochromatic, color, or mosaiced frames. Our approach includes a joint method for simultaneous SR,
Elad Michael +2 more
doaj +1 more source
Dumb and Lazy? A Comparison of Color Learning and Memory Retrieval in Drones and Workers of the Buff-Tailed Bumblebee, Bombus terrestris, by Means of PER Conditioning. [PDF]
PLoS ONE, 2015 More than 100 years ago, Karl von Frisch showed that honeybee workers learn and discriminate colors. Since then, many studies confirmed the color learning capabilities of females from various hymenopteran species.
Leonie Lichtenstein +2 more
doaj +1 more source
QuatJND: A Robust Quaternion JND Model for Color Image Watermarking
Entropy, 2022 Robust quantization watermarking with perceptual JND model has made a great success for image copyright protection. Generally, either restores each color channel separately or processes the vector representation from three color channels with the ...
Wenbo Wan +4 more
doaj +1 more source
Monochromatic triangles in two-colored plane [PDF]
Combinatorica, 2009 20 pages, 9 ...
Jelínek, Vít +3 more
openaire +2 more sources
Monochromatic progressions in random colorings
Journal of Combinatorial Theory, Series A, 2012 Let N^{+}(k)= 2^{k/2} k^{3/2} f(k) and N^{-}(k)= 2^{k/2} k^{1/2} g(k) where 1=o(f(k)) and g(k)=o(1). We show that the probability of a random 2-coloring of {1,2,...,N^{+}(k)} containing a monochromatic k-term arithmetic progression approaches 1, and the probability of a random 2-coloring of {1,2,...,N^{-}(k)} containing a monochromatic k-term ...
openaire +3 more sources
On Some Multicolor Ramsey Numbers Involving $K_3+e$ and $K_4-e$
, 2012 The Ramsey number $R(G_1, G_2, G_3)$ is the smallest positive integer $n$ such that for all 3-colorings of the edges of $K_n$ there is a monochromatic $G_1$ in the first color, $G_2$ in the second color, or $G_3$ in the third color.
Radziszowski, Stanisław P. +2 more
core +1 more source