In flowering plants, the arrangement of flowers on a stem becomes an inflorescence, and a huge variety of inflorescence architecture occurs in nature. Inflorescence architecture also affects crop yield. In simple inflorescences, flowers form on a main stem; by contrast, in compound inflorescences, flowers form on branched stems and the branching pattern defines the architecture of the infloresc...

carotenoids are the main pigments of tomato, of which 93% is lycopene. lycopene has desirable physiological effects in human sush as cancer prevention. recent years, because of harmful side effects of synthetic colouring agents used in food products, employing of natural food colouring agents has become very important. in this research firstly, solvent extraction method was used for tomato caro...

For a positive integer k, a k-colouring of a graph G = (V,E) is a mapping c : V → {1, 2, . . . , k} such that c(u) 6= c(v) whenever uv ∈ E. The COLOURING problem is to decide, for a given G and k, whether a k-colouring of G exists. If k is fixed (that is, it is not part of the input), we have the decision problem k-COLOURING instead. We survey known results on the computational complexity of CO...

in order to evaluate the allelopathic potential of sunflower (helianthus annus l.) organs on germination and growth of dodder (cuscuta compestris l.), series studies were conducted in three separate experiments; as factorial based on completely randomized design (crd) with three replications for each experiments. first experiment was conducted in petri dishes and consisted of sunflower organs a...

M@n@gement is a double-blind reviewed journal where articles are published in their original language as soon as they have been accepted. Copies of this article can be made free of charge and without securing permission, for purposes of teaching, research, or library reserve. Consent to other kinds of copying, such as that for creating new works, or for resale, must be obtained from both the jo...

Lovász invoked topological colouring bounds in proving Kneser’s Conjecture. Subsequently, numerous applications of topological techniques to graph colouring problems have arisen. However, even today, little is known about how to construct a graph with a particular topological colouring bound, or about the structure of such graphs. The aim of this thesis is to remedy this deficit. First, we will...

Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems. In this paper we review several variants of graph colouring, such as precolouring extension, list colouring, multicolouring, minimum sum colouring, and discuss their applications in scheduling.