Graph connectivity and Hamiltonian properties lie at the heart of both theoretical combinatorics and practical network design. Connectivity quantifies the robustness of a network by the minimum number ...

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.