KUMBHAR B. A. AND DABGAR Y. B. Dept. of Biotechnology, Sheth M.N. Science College, Patan (Gujarat) India R.R. Mehta College of Science and C.L. Parikh College of Commerce, Palanpur (Gujarat) India Abstract This study investigated the allelopathic effects of various weed (Euphorbia thiamifolia L.) plant parts on pigeon pea germination and seedling growth. Aqueous extracts of Euphorbia thiamifoli...

In Arabidopsis, floral meristems arise in continuous succession directly on the flanks of the inflorescence meristem. Thus, the pathways that regulate inflorescence and floral meristem identity must operate both simultaneously and in close spatial proximity. The TERMINAL FLOWER 1 (TFL1) gene of Arabidopsis is required for normal inflorescence meristem function, and the LEAFY (LFY), APETALA 1 (A...

A tropical graph (H, c) consists of a graph H and a (not necessarily proper) vertex-colouring c of H. For a fixed tropical graph (H, c), the decision problem (H, c)-Colouring asks whether a given input tropical graph (G, c1) admits a homomorphism to (H, c), that is, a standard graph homomorphism of G to H that also preserves vertex-colours. We initiate the study of the computational complexity ...

The 3-Colouring of a graph is a classic NP-complete problem. We show that some solutions for the 3-Colouring can be built in polynomial time based on the number of basic cycles existing in the graph. For this, we design a reduction from proper 3-Colouring of a graph G to a 2-CF Boolean formula FG, where the number of clauses in FG depends on the number of basic cycles in G. Any model of FG prov...

In a previous publication (4) it was shown that the red portion of the visible spectrum was especially effective in inducing photoperiodic responses in long day plants when used to prolong short winter days. These responses generally included earlier flowering, increased internodal development, and a greater top-root ratio. The yellow, blue, and green regions of the visible spectrum of waveleng...

McDiarmid C.J.H. and A. Sanchez-Arroyo, An upper bound for total colouring of graphs, Discrete Mathematics 111 (1993) 3899392. We give an upper bound on the number of colours required to extend a given vertex colouring of a graph to a total colouring. This shows that for any simple graph there is a total colouring using at most :d + 3 colours, where A is the maximum vertex degree.