Brualdi and Hollingsworth conjectured that, for even n, in a proper edge coloring of Kn using precisely n − 1 colors, the edge set can be partitioned into n2 spanning trees which are rainbow (and hence, precisely one edge from each color class is in each spanning tree). They proved that there always are two edge disjoint rainbow spanning trees. Kaneko, Kano and Suzuki improved this to three edg...

In verbal memory, similarity between items in memory often leads to interference and impaired memory performance. The present study sought to determine whether analogous interference effects would be observed in visual working memory by varying the similarity of the to-be-remembered objects in a color change-detection task. Instead of leading to interference and impaired performance, increased ...

BACKGROUND Understanding the dimensions of pathways of introduction of alien plants is important for regulating species invasions, but how particular pathways differ in terms of post-invasion success of species they deliver has never been rigorously tested. We asked whether invasion status, distribution and habitat range of 1,007 alien plant species introduced after 1500 A.D. to the Czech Repub...

It has long been known that colored images may elicit afterimages in complementary colors. We have already shown (Van Lier, Vergeer, & Anstis, 2009) that one and the same adapting image may result in different afterimage colors, depending on the test contours presented after the colored image. The color of the afterimage depends on two adapting colors, those both inside and outside the test. He...

A binary code with the same weight distribution as its dual code is called formally self-dual (f.s.d.). We only consider f.s.d. even codes (codes with only even weight codewords). We show that any formally self-dual even binary code C of length n not divisible by 8 is balanced. We show that the weight distribution of a balanced near-extremal f.s.d. even code of length a multiple of 8 is unique....

Let G = (V,E) be a vertex-colored graph, where C is the set of colors used to color V . The Graph Motif (or GM) problem takes as input G, a multisetM of colors built from C, and asks whether there is a subset S ⊆ V such that (i) G[S] is connected and (ii) the multiset of colors obtained from S equals M . The Colorful Graph Motif (or CGM) problem is the special case of GM in which M is a set, an...

BACKGROUND For the purposes of our research programme we needed a simple, reliable and validated method for allowing choice of a color in response to a series of questions. On reviewing the literature no such instrument was available and this study aimed to rectify this situation. This was achieved by developing a simple method of presenting a series of colors to people validating it in healthy...

Colors are the smiles of nature. Digital image processing has widely employed use function color due to its effectiveness as a tool in classifying and identifying objects, which can be distinguished based on various relevant shades color. This work aims create software that assists color-blind individuals colors edges an may appear similar them. If you not suffering from vision deficiency it is...