Hardness and algorithms for rainbow connectivity

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 243-254

  Chakraborty, Sourav ^a   Fischer, Eldar ^a   Matsliah, Arie ^b   Yuster, Raphael ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b CWI   (Netherlands)

^c UNIVERSITY OF HAIFA   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CELLULAR NETWORK; CONNECTED GRAPH; EDGE COLORED GRAPHS; MINIMUM DEGREE; NATURAL COMBINATORIAL PROBLEMS; POLYNOMIAL-TIME; POSITIVE SIDES; RAINBOW CONNECTIVITIES;

COLOR; COMPUTER SCIENCE; POLYNOMIAL APPROXIMATION;

GRAPH THEORY;

EID: 84880247437     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. N. Alon, R.A. Duke, H. Lefmann, V. Rödl, and R. Yuster, The algorithmic aspects of the Regularity Lemma, Journal of Algorithms 16 (1994), 80-109.
2. N. Alon and J. H. Spencer, The Probabilistic Method, Second Edition, Wiley, New York, 2000.
3. 3/14)-coloring algorithm for 3-colorable graphs, Inform. Process. Lett., 61(1): 49-53, 1997.
4. B. Bollobás, Modern Graph Theory, Graduate Texts in Mathematics 184, Springer-Verlag 1998.
5. G. Chartrand, G. L. Johns, K. A. McKeon, and P. Zhang, Rainbow connection in graphs, Math. Bohem., 133 (2008), no. 1, 85-98.
6. Y. Caro, A. Lev, Y. Roditty, Z. Tuza, and R. Yuster, On rainbow connectivity, The Electronic Journal of Combinatorics 15(2008), Paper R57.
7. E. Fischer, A. Matsliah, and A. Shapira, Approximate Hypergraph Partitioning and Applications, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS) 579-589 (2007).
8. J. Komlós and M. Simonovits, Szemerédis Regularity Lemma and its applications in graph theory, In: Combinatorics, Paul Erdös is Eighty (D. Miklós, V. T. Sós, and T. Szönyi, Eds.), Bolyai Society Mathematical Studies, Vol. 2, Budapest (1996), 295-352.
9. E. Szemerédi Regular partitions of graphs, Proc. Colloque Inter. CNRS 260, (CNRS, Paris) 399-401 (1978).