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.