Results 261 to 270 of about 119,624 (313)
Some of the next articles are maybe not open access.
The Journal of General Psychology, 1957
(1957). Colors and the Color-Blind. The Journal of General Psychology: Vol. 57, No. 2, pp. 229-240.
P R, HOFSTAETTER, D W, PRIMAC
openaire +2 more sources
(1957). Colors and the Color-Blind. The Journal of General Psychology: Vol. 57, No. 2, pp. 229-240.
P R, HOFSTAETTER, D W, PRIMAC
openaire +2 more sources
Cut-Colorings in Coloring Graphs
Graphs and Combinatorics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Prateek Bhakta +5 more
openaire +2 more sources
Coloring with three‐colored subgraphs
Journal of Graph Theory, 2003AbstractLet f(n) be the minimum number of colors required to color the edges of Kn,n such that every copy of K3,3 receives at least three colors on its edges. We prove that $$(0.62+o(1))\sqrt{n}< \, f(n)< \, (1+o(1))\sqrt{n}$$, where the upper bound is obtained by an explicit edge‐coloring.
openaire +1 more source
THE COLORING OF THE TREE OF COLORINGS
Advances and Applications in Discrete Mathematics, 2022Cherniavsky, Yonah, Jarden, Adi
openaire +2 more sources