We investigate a coloring problem, called ordered coloring, in grids and some other families of grid-like graphs. Ordered coloring (also known as vertex ranking) is related to conflict-free coloring and other traditional coloring problems. Such coloring problems can model (among others) efficient frequency assignments in cellular networks. Our main technical results improve upper and lower boun...

In this paper we propose a deterministic parallel graph coloring algorithm that enables Multi-Coloring in parallel for sparse undirected graphs by coarse-grained segmentation and auxiliary graph coloring. The proposed algorithm is implemented and tested on standard problem instances from engineering applications and benchmarked against various relevant deterministic graph coloring algorithms. Q...

The present two-part study examined the effects of coloring mandalas on state anxiety reduction with considerations of duration spent coloring and Big-5 personality traits. It was hypothesized that coloring mandalas for 30 minutes would significantly reduce levels of state anxiety. There were three coloring conditions that were randomly assigned to 105 participants. Measures included a Spielber...

We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover all the vertices of a given graph. We prove the NP-hardness of some cases. We derive approximation results for Min Split-coloring and Min Cocoloring in line graphs, comparability graphs and general graphs. This provide...

Mindfulness has been associated with the use of coloring books for adults; however, the question of whether they do increase mindfulness has not been addressed. In two studies, we attempted to identify whether mindfulness is increased, and whether there is a need for ongoing guidance while coloring, similar to mindfulness meditation. In the first randomized controlled experiment, university stu...

This lecture deals with the problem of proper vertex colorings of graphs. More speciically, we are interested in coloring a given 3-colorable graph with as few colors as we can. It is easy to see that it is NP-Hard to nd a 3 coloring for any given 3-colorable graph-this would enable deciding whether a general graph is 3-colorable. If a polynomial-time algorithm existed for 3-coloring a 3-colora...

agent technology is an emerging and promising research area in software technology, which increasingly contributes to the development of value-added information systems for large healthcare organizations due to its capability to automatically modify themselves in response to changes in their operating environment. multi agent system (mas) approach is the construction of a complex system as a se...

Abstract Curcumin, which is derived from the turmeric rhizomes (curcuma longa) as a natural polyphenol, is a substantially lipophilic molecule. This commonly used substance is employed as a spice and coloring agent in food and contains potent antioxidant, as well as anti-inflammatory, and anti-proliferative tumor activities. The developed nanomicelle formulations of curcumin are used to ...

the colorful paths and rainbow paths have been considered by severalauthors.a colorful directed path in a digraph $g$ is a directed path with $chi(g)$ vertices whose colors are different. a $v$-colorful directed path is such a directed path, starting from $v$. we prove that for a given $3$-regular triangle-free digraph $g$ determining whether there is a proper $chi(g)$-coloring of $g$such that ...

Given a nite directed graph, a coloring of its edges turns the graph into a nite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet of colors at its edges that maps the state set of the automaton at least on k-element subset. A coloring of edges of a directed strongly connected nite graph of a uniform outdegree (constant outdegree of any vertex) is k-...