In the fractional graph colouring problem, the task is to schedule the activities of the nodes so that each node is active for 1 time unit in total, and at each point of time the set of active nodes forms an independent set. We show that for any α > 1 there exists a deterministic distributed algorithm that finds a fractional graph colouring of length at most α(∆ + 1) in any graph in one synchro...

Olive grows in the mid-latitudes in the world and in areas with Mediterranean climate. Olive is one of the important agricultural products in Mediterranean Basin and Turkey. Its contribution to economy makes it valuable to determine the genetic relations among different olive varieties. In this study, genetic variations among 13 different olive cultivars were determined through 22 ISSR primers ...

Ergönül P.G., Nergiz C. (2010): Determination of organic acids in olive fruit by HPLC. Czech J. Food Sci., 28: 202–205. Organic acids (oxalic, citric, malic, and succinic) contents of Domat, Memecik and Uslu varieties of olives grown in Turkey were investigated using HPLC method. Organic acids were extracted from olives with water-methanol mixture solution 75:25 (v/v) and were analysed through ...

Meta-kernelization theorems are general results that provide polynomial kernels for large classes of parameterized problems. The known meta-kernelization theorems, in particular the results of Bodlaender et al. (FOCS’09) and of Fomin et al. (FOCS’10), apply to optimization problems parameterized by solution size. We present meta-kernelization theorems that use a structural parameters of the inp...

Consider a graph and a collection of (not necessarily edge-disjoint) connected spanning subgraphs (factors) of the graph. We consider the problem of coloring the vertices of the graph so that each color class of the vertices dominates each factor. We find upper and lower bounds on α(t, k), which we define as the minimum radius of domination d such that every graph with a collection of k factors...

We consider locally finite graphs with vertex set N. A graph G is computable if the edge set is computable and highly computable if the neighborhood function NG (which given v outputs all of its adjacent vertices) is computable. Let χ(G) be the chromatic number of G and χ(G) be the computable chromatic number of G. Bean showed there is a computable graph G with χ(G) = 3 and χ(G) =∞, but if G is...