The rainbow connection number of 2-connected graphs

Details The rainbow connection number of 2-connected graphs The rainbow connection number of 2-connected graphs

2011-10-26

arxiv.org/abs/1110.5736v1

Mathematics

Combinatorics

Scientific paper

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 contains no colour twice. Improving a result of Caro et
al., we prove that the rainbow connection number of every 2-connected graph
with n vertices is at most the ceiling of n/2. The bound is optimal.

Affiliated with

Also associated with

No associations

Rating

The rainbow connection number of 2-connected graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The rainbow connection number of 2-connected graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The rainbow connection number of 2-connected graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-716973