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 ...

Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...