Search Results for ""
11 - 20 of 209 for color perceptionSearch Results
View search results from all Wolfram sites (10897 matches)The empire problem, also known as the m-pire problem) asks for the maximum number of colors needed to color countries such that no two countries sharing a common border have ...
The Hadwiger conjecture is a generalization of the four-color theorem which states that for any loopless graph G with h(G) the Hadwiger number and chi(G) the chromatic ...
Every graph with n vertices and maximum vertex degree Delta(G)<=k is (k+1)-colorable with all color classes of size |_n/(k+1)_| or [n/(k+1)], where |_x_| is the floor ...
An official chessboard is an 8×8 board containing squares alternating in color between olive green and buff (where "buff" is a color variously defined as a moderate orange ...
Martin Gardner (1975) played an April Fool's joke by asserting that the map of 110 regions illustrated above (left figure) required five colors and constitutes a ...
A stereogram made of two pictures, one red and one blue, taken from offset positions. When the pictures are viewed through glasses with one lens of each color, the picture ...
Rule 126 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
Rule 182 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
Rule 250 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...
Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...
...