A new variation of the coloring problem, mu-coloring, is defined in this paper. A coloring of a graph G = (V,E) is a function f: V -> N such that f(v) is different from f(w) if v is adjacent to w. Given a graph G = (V,E) ...

The purpose of this study was to assess color alteration of the paints used for iris painting in artificial eyes. Five disks of heat cured acrylic resin were confectioned by microwave energy for each paint analyzed, in a ...

Este documento resume los aspectos centrales de la teoría del color que se deben tomar en cuenta a la hora de diseñar.

We deal with some generalizations of the graph coloring problem on classes of perfect graphs. Namely we consider the μ-coloring problem (upper bounds for the color on each vertex), the precoloring extension problem (a ...