Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs

Shasha Li, Xueliang Li and Yongtang Shi

Applied Mathematics and Computation, 2015, vol. 258, issue C, 155-161

Abstract: A path in an edge-colored graph is said to be a rainbow path if no two edges on the path share 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. A vertex-colored graph G is rainbow vertex-connected if any pair of vertices in G are connected by a path whose internal vertices have distinct colors. The rainbow vertex-connection number of a connected graph G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex-connected. Though for a general graph G it is NP-Complete to decide whether rc(G)=2 (or rvc(G)=2), in this paper, we show that the problem becomes easy when G is a bipartite graph. Whereas deciding whether rc(G)=3 (or rvc(G)=3) is still NP-Complete, even when G is a bipartite graph. Moreover, it is known that deciding whether a given edge(vertex)-colored (with an unbound number of colors) graph is rainbow (vertex-) connected is NP-Complete. We will prove that it is still NP-Complete even when the edge(vertex)-colored graph is bipartite. We also show that a few NP-hard problems on rainbow connection are indeed NP-Complete.

Keywords: (Strong) rainbow connection; Rainbow vertex-connection; Bipartite graph; NP-Complete; Polynomial-time (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031500168X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:258:y:2015:i:c:p:155-161

DOI: 10.1016/j.amc.2015.02.015

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().