413 Indian Journal of Dermatology 2014; 59(4) the patient may have taken, or due to the coloring agent titanium dioxide present in the tablet of levocetirizine. However, detailed history taking excluded possibility of both, as there was no other drug intake during last 4 weeks. Also, the patient did not develop any reaction on provocation with fexofenadine, which contained titanium dioxide. The...

A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, such that no two adjacent or incident elements receive the same color. Let L(x) be a set of colors assigned to each element x of G. Then a list total coloring of G is a total coloring such that each element x receives a color contained in L(x). The list total coloring problem asks whether G has a list tot...

Abstract Saffron ( Crocus sativus L., Iridaceae) is a highly valued species in the food, medicinal, and nutraceutical industries as coloring, flavoring, therapeutic agent. Its productivity flower production vary depending on different factors, including fertilizer treatment. This study was conducted to evaluate effects of inorganic (NK) combined with organic matter plant densities well influenc...

The question of what global information must distributed rational agents a-priori know aboutthe network in order for equilibrium to be possible is researched here. Until now, distributedalgorithms with rational agents have assumed that n, the size of the network, is a-priori known tothe participants. We investigate the above question, considering different distributed computingp...

Graph coloring is the de facto standard technique for register allocation within a compiler. In this paper we examine the intuition that a better coloring algorithm results in better register allocation. By replacing the coloring phase of the gcc compiler’s register allocator with an optimal coloring algorithm, we demonstrate both the importance of extending the graph coloring model to better e...

We study the weighted improper coloring problem, a generalization of defective coloring. We present some hardness results and in particular we show that weighted improper coloring is not fixed-parameter tractable when parameterized by pathwidth. We generalize bounds for defective coloring to weighted improper coloring and give a bound for weighted improper coloring in terms of the sum of edge w...

The Grundy number of a graph is the maximum number of colors used by the greedy coloring algorithm over all vertex orderings. In this paper, we study the computational complexity of Grundy Coloring, the problem of determining whether a given graph has Grundy number at least k. We also study the variants Weak Grundy Coloring (where the coloring is not necessarily proper) and Connected Grundy Col...

We study the weighted improper coloring problem, a generalization of defective coloring. We present some hardness results and in particular we show that weighted improper coloring is not fixed-parameter tractable when parameterized by pathwidth. We generalize bounds for defective coloring to weighted improper coloring and give a bound for weighted improper coloring in terms of the sum of edge w...