Hardness and algorithms for rainbow connection
- 287 Downloads
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 rc(G), is the smallest number of colors that are needed in order to make G rainbow connected. In the first result of this paper we prove that computing rc(G) is NP-Hard solving an open problem from Caro et al. (Electron. J. Comb. 15, 2008, Paper R57). In fact, we prove that it is already NP-Complete to decide if rc(G)=2, and also that it is NP-Complete to decide whether a given edge-colored (with an unbounded number of colors) graph is rainbow connected. On the positive side, we prove that for every ε>0, a connected graph with minimum degree at least ε n has bounded rainbow connection, where the bound depends only on ε, and a corresponding coloring can be constructed in polynomial time. Additional non-trivial upper bounds, as well as open problems and conjectures are also presented.
KeywordsConnectivity Rainbow coloring
Unable to display preview. Download preview PDF.
- Caro Y, Lev A, Roditty Y, Tuza Z, Yuster R (2008) On rainbow connection, Electron J Comb 15, Paper R57 Google Scholar
- Fischer E, Matsliah A, Shapira A (2007) Approximate hypergraph partitioning and applications. In: Proceedings of the 48th annual IEEE symposium on foundations of computer science (FOCS), pp 579–589 Google Scholar
- Komlós J, Simonovits M (1996) Szemerédi’s Regularity Lemma and its applications in graph theory. In: Miklós, D, Sós, VT, Szönyi, T (eds) Combinatorics, Paul Erdös is Eighty. Bolyai society mathematical studies, vol 2. Budapest, pp 295–352 Google Scholar
- Szemerédi E (1978) Regular partitions of graphs. In: Proc. colloque inter. CNRS 260. CNRS, Paris, pp 399–401. Google Scholar