Coloring
31coloring book — noun A book containing line art for readers (usually children) to add color using crayons, colored pencils, markers, paint or other artistic media …
32coloring material — noun any material used for its color she used a different color for the trim • Syn: ↑colouring material, ↑color, ↑colour • Derivationally related forms: ↑colour (for: ↑colour), ↑ …
33Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… …
34Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …
35Food coloring — spreading on a thin water film in the International Space Station. Food coloring is a substance, liquid or powder, that is added to food and/or drink to change its color. Food coloring is used both in commercial food production and in domestic… …
36Road coloring problem — In graph theory the road coloring theorem, known until recently as the road coloring conjecture, deals with synchronized instructions. The issue involves whether by using such instructions, one can reach or locate an object or destination from… …
37Hair coloring — A hairdresser colors a client s hair. Hair coloring is the practice of changing the color of hair. Common reasons are to cover gray hair, to change to a color regarded as more fashionable or desirable, and to restore the original hair color after …
38List coloring — In graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors, first studied by Vizing [1] and by Erdős, Rubin, and Taylor.[2][3][4] …
39Total coloring — [ Proper total coloring of Foster Cage with 6 colors. The total chromatic number of this graph is 6 sincethe degree of each vertex is 5 (5 adjacent edges + 1 vertex=6).] In graph theory, total coloring is a type of coloring on the vertices and… …
40Complete coloring — of the Clebsch graph with 8 colors. Every pair of colors appears on at least one edge. No complete coloring with more colors exists: in any 9 coloring some color would appear only at one vertex, and there would not be enough neighboring vertices… …
