Graphs with rainbow connection number two
Arnfried Kemnitz ; Ingo Schiermeyer
Discussiones Mathematicae Graph Theory, Tome 31 (2011), p. 313-320 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. In this paper we prove that rc(G) = 2 for every connected graph G of order n and size m, where n-12+1≤m≤n2-1. We also characterize graphs with rainbow connection number two and large clique number.

Publié le : 2011-01-01
EUDML-ID : urn:eudml:doc:271041 
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1547,
     author = {Arnfried Kemnitz and Ingo Schiermeyer},
     title = {Graphs with rainbow connection number two},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {31},
     year = {2011},
     pages = {313-320},
     zbl = {1234.05092},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1547}
}

Arnfried Kemnitz; Ingo Schiermeyer. Graphs with rainbow connection number two. Discussiones Mathematicae Graph Theory, Tome 31 (2011) pp. 313-320. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1547/

[000] [1] J.A. Bondy and U.S.R. Murty, Graph Theory (Springer, 2008), doi: 10.1007/978-1-84628-970-5.

[001] [2] S. Chakraborty, E. Fischer, A. Matsliah and R. Yuster, Hardness and algorithms for rainbow connectivity, Proceedings STACS 2009, to appear in Journal of Combinatorial Optimization. | Zbl 1236.68080

[002] [3] Y. Caro, A. Lev, Y. Roditty, Z. Tuza and R. Yuster On rainbow connection, Electronic J. Combin. 15 (2008) #57.

[003] [4] G. Chartrand, G.L. Johns, K.A. McKeon and P. Zhang, Rainbow connection in graphs, Math. Bohemica 133 (2008) 85-98. | Zbl 1199.05106

[004] [5] A.B. Ericksen, A matter of security, Graduating Engineer & Computer Careers (2007) 24-28.

[005] [6] M. Krivelevich and R. Yuster, The rainbow connection of a graph is (at most) reciprocal to its minimum degree, J. Graph Theory 63 (2010) 185-191. | Zbl 1193.05079

[006] [7] V.B. Le and Z. Tuza, Finding optimal rainbow connection is hard, preprint 2009.

[007] [8] I. Schiermeyer, Rainbow connection in graphs with minimum degree three, IWOCA 2009, LNCS 5874 (2009) 432-437. | Zbl 1267.05125