JCO
2011
13 years 7 months ago
2011
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...
JGT
2010
13 years 11 months ago
2010
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...
JCT
2010
13 years 11 months ago
2010
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 ...
DCG
2007
14 years 16 days ago
2007
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...
COMBINATORICS
2006
14 years 19 days ago
2006
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...