Rainbow connectivity examines how to assign colours to the edges of a graph so that every pair of vertices is joined by at least one “rainbow path”—a path in which no two edges share the same colour.

Graph labeling and colouring constitute a vibrant area of combinatorial mathematics concerned with the systematic assignment of discrete labels or colours to graph elements—typically vertices, edges ...