… of rainbow colouring split graphs and a particular subclass of split graphs called threshold
graphs (… The problem of deciding whether a graph can be rainbow coloured using 3 colours …

… any rainbow colouring of G should assign different colours to … do a rainbow colouring of a
split graph G using one colour more … G can be rainbow coloured using | pen ( G ) | colours if G , …

… graph Kn is rainbow c-splittable. For not necessarily complete graphs, we show that the
Rainbow c-Splitting problem is NP-complete for c ≥ 3 and remains so even if the graph is c-…

… of split graphs, which are a proper subclass of chordal graphs. … determine the rainbow
connection number of split graphs, but … will rainbow colour any split graph G using at most rc(G)+1 …

… split graphs. To complement the negative results, we show that bipartite permutation graphs,
interval graphs, and block graphs can be rainbow … split graphs give the first non-trivial graph …

… in the complete split graph. Since the complete split graph contains the complete graph as
a … the previous results about the anti-Ramsey number of matchings in the complete graph. …

… 3 Hardness of strongly rainbow-connecting split graphs In this section, we show that
deciding whether a split graph can be strongly rainbow-connected with k ≥ 3 colors is NP-complete…

… An edge-coloring of a graph is called strong rainbow if any two … rainbow connection number
of G, denoted by src(G). In this paper we study the rc and src of the m-splitting of a graph. In …

… graph has a trivial edge-coloring that makes it rainbow connected by coloring edges with
distinct colors. Thus, we define the rainbow connection number of a connected graph G… rainbow …

… -decompositions of graphs into other rainbow structures like … graph can be nearly-decomposed
into spanning rainbow trees. … The proof of A7 consists of first splitting the colours of H at …