Sciweavers

JCO
2011
113views more  JCO 2011»
13 years 5 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
JGT
2010
90views more  JGT 2010»
13 years 9 months ago
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
Michael Krivelevich, Raphael Yuster
JCT
2010
111views more  JCT 2010»
13 years 9 months ago
Anti-Ramsey properties of random graphs
We call a coloring of the edge set of a graph G a b-bounded coloring if no color is used more than b times. We say that a subset of the edges of G is rainbow if each edge is of a ...
Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliffor...
DCG
2007
106views more  DCG 2007»
13 years 10 months ago
A Combinatorial Property of Points and Balls, a Colored Version
Any finite set X ⊂ Rd colored with d+3 2 colors, contains a rainbow subset Y ⊂ X, such that any ball that contains Y contains a positive fraction of the points of X. The bound...
Maria N. Prodromou
COMBINATORICS
2006
128views more  COMBINATORICS 2006»
13 years 11 months ago
On Lengths of Rainbow Cycles
We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr...
Boris Alexeev