Note on the complexity of deciding the rainbow connectedness for bipartite graphs

Details Note on the complexity of deciding the rainbow connectedness for bipartite graphs Note on the complexity of deciding the rainbow connectedness for bipartite graphs

2011-09-26

arxiv.org/abs/1109.5534v2

Computer Science

Computational Complexity

6 pages

Scientific paper

A path in an edge-colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge-colored graph is (strongly) rainbow connected if there exists a rainbow (geodesic) path between every pair of vertices. The (strong) rainbow connection number of $G$, denoted by ($scr(G)$, respectively) $rc(G)$, is the smallest number of colors that are needed in order to make $G$ (strongly) rainbow connected. Though for a general graph $G$ it is NP-Complete to decide whether $rc(G)=2$, in this paper, we show that the problem becomes easy when $G$ is a bipartite graph. Moreover, it is known that deciding whether a given edge-colored (with an unbound number of colors) graph is rainbow connected is NP-Complete. We will prove that it is still NP-Complete even when the edge-colored graph is bipartite. We also show that a few NP-hard problems on rainbow connection are indeed NP-Complete.

Affiliated with

Also associated with

No associations

Rating

Note on the complexity of deciding the rainbow connectedness for bipartite 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 Note on the complexity of deciding the rainbow connectedness for bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Note on the complexity of deciding the rainbow connectedness for bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-689058