5 citations · 5 across the 12 of their papers we have counts for
1 paper · 2 filters
Jan Ekstein, Přemysl Holub, Tomáš Kaiser +4
The rainbow connection number of a graph G is the least number of colours in a (not necessarily proper) edge-colouring of G such that every two vertices are joined by a path which…