5 citations · 12 across the 18 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
math.CO2011
Rainbow connection number of dense graphs
Xueliang Li, Mengmeng Liu, Ingo Schiermeyer
An edge-colored graph is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph …
math.CO2011
The rainbow connection number of 2-connected graphs
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…