A rainbow colouring of a connected graph is a colouring of the edges of the graph, such that every pair of vertices is connected by at least one path in which no two edges are coloured the same. Such a colouring using minimum possible number of colours is called an optimal rainbow colouring, and the minimum number of colours required is called the rainbow connection number of the graph. A Chord...

We examine the behavior of the first-order rainbow for a coated sphere by using both ray theory and Aden-Kerker wave theory as the radius of the core a(12) and the thickness of the coating δ are varied. As the ratio δ/a(12) increases from 10(-4) to 0.33, we find three classes of rainbow phenomena that cannot occur for a homogeneous-sphere rainbow. For δ/a(12) ≲ 10(-3), the rainbow intensity is ...

MOTIVATION The innovation of restriction-site associated DNA sequencing (RAD-seq) method takes full advantage of next-generation sequencing technology. By clustering paired-end short reads into groups with their own unique tags, RAD-seq assembly problem is divided into subproblems. Fast and accurately clustering and assembling millions of RAD-seq reads with sequencing errors, different levels o...

In a properly vertex-colored graphG, a path P is a rainbow path if no two vertices of P have the same color, except possibly the two end-vertices of P . If every two vertices of G are connected by a rainbow path, then G is vertex rainbow-connected. A proper vertex coloring of a connected graph G that results in a vertex rainbow-connected graph is a vertex rainbow coloring ofG. The minimum numbe...

Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is called a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G), a tree that connects S in G is called an S-tree. The minimum number of colors that are needed in an edge-coloring of G such that there is a ra...

We consider a proper coloring of plane graph such that no face is rainbow, where rainbow if any two vertices on its boundary have distinct colors. Such said to be anti-rainbow. A quadrangulation G in which all faces are bounded by cycle length 4. In this paper, we show the number colors anti-rainbow does not exceed $$3\alpha (G)/2$$ , $$\alpha (G)$$ independence G. Moreover, minimum degree 3 or...

Given an edge-coloured graph, we say that a subgraph is rainbow if all of its edges have different colours. Let $\operatorname{ex}(n,H,$rainbow-$F)$ denote the maximal number copies $H$ properly graph on $n$ vertices can contain it has no isomorphic to $F$. We determine order magnitude $\operatorname{ex}(n,C_s,$rainbow-$C_t)$ for $s,t$ with $s\not =3$. In particular, answer question Gerbner, M\...

This paper presents an overview of the current state in research directions in the rainbow Ramsey theory. We list results, problems, and conjectures related to existence of rainbow arithmetic progressions in [n] and N. A general perspective on other rainbow Ramsey type problems is given.

A construction of conformal infinity in null and spatial directions is constructed for the Rainbow-flat space-time corresponding to doubly special relativity. From this construction a definition of asymptotic DSRness is put forward which is compatible with the correspondence principle of Rainbow Gravity. Furthermore a result equating asymptotically flat space-times with asymptotically DSR space...

A rainbow colouring of a connected graph G is a colouring of the edges of G such that every pair of vertices in G is connected by at least one path in which no two edges are coloured the same. The minimum number of colours required to rainbow colour G is called its rainbow connection number. Chakraborty, Fischer, Matsliah and Yuster have shown that it is NP-hard to compute the rainbow connectio...