Graph coloring is one of the central problems in distributed graph algorithms. Much of the research on this topic has focused on coloring with ∆ + 1 colors, where ∆ denotes the maximum degree. Using ∆+1 colors may be unsatisfactory in sparse graphs, where not all nodes have such a high degree; it would be more desirable to use a number of colors that improves with sparsity. A standard measure t...

In this paper, the problem of choosing a set of most separable colors in a given environment is discussed. The proposed method models the process of generating theoretically computed best colors, printing of these colors through a color printer, and imaging the printed colors through a camera into an integrated framework. Thus, it provides a feasible way to generate practically best separable c...

Recently, it has been demonstrated that people associate each of the basic tastes (e.g., sweet, sour, bitter, and salty) with specific colors (e.g., red, green, black, and white). In the present study, we investigated whether pairs of colors (both associated with a particular taste or taste word) would give rise to stronger associations relative to pairs of colors that were associated with diff...