12 citations · 15 across the 9 of their papers we have counts for
1 paper · 1 filter
Nina Kamčev, Michael Krivelevich, Benny Sudakov
An edge (vertex) coloured graph is rainbow-connected if there is a rainbow path between any two vertices, i.e. a path all of whose edges (internal vertices) carry distinct colours.…