105 citations · 146 across the 19 of their papers we have counts for
Showing 2008 · math.COShow all
2 papers · 2 filters
math.CO2008★ 3 cited
Hardness and Algorithms for Rainbow Connection
Sourav Chakraborty, Eldar Fischer, Arie Matsliah +1
An edge-colored graph is {\em rainbow connected} if any two vertices are connected by a path whose edges have distinct colors. The {\em rainbow connection} of a connected graph…
math.CO2008★ 3 cited
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Raphael Yuster
For every fixed graph and every fixed , we show that if a graph has the property that all subsets of size contain the ``correct'' number of copies of one…