Rainbow Connections of Graphs: A Survey

The concept of rainbow connection was introduced by Chartrand et al. [ 14 ] in 2008. It is interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Graphs and combinatorics Jg. 29; H. 1; S. 1 - 38
Hauptverfasser:	Li, Xueliang, Shi, Yongtang, Sun, Yuefang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Japan Springer Japan 01.01.2013 Springer Nature B.V
Schlagworte:	Algorithms Categories Combinatorial analysis Combinatorics Complexity Computation Computational mathematics Engineering Design Graph algorithms Graph theory Graphs Joints Mathematics Mathematics and Statistics Rainbows Survey 68Q25 (Strong) rainbow connection number 05D40 05C40 Rainbow path Algorithm Computational complexity Rainbow vertex-connection number connectivity Rainbow 68R10 rainbow index 05C35 05C15
ISSN:	0911-0119, 1435-5914
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	The concept of rainbow connection was introduced by Chartrand et al. [ 14 ] in 2008. It is interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then try to organize the work into five categories, including (strong) rainbow connection number, rainbow k -connectivity, k -rainbow index, rainbow vertex-connection number, algorithms and computational complexity. This survey also contains some conjectures, open problems and questions.
AbstractList	The concept of rainbow connection was introduced by Chartrand et al. [ 14 ] in 2008. It is interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then try to organize the work into five categories, including (strong) rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity. This survey also contains some conjectures, open problems and questions.[PUBLICATION ABSTRACT] The concept of rainbow connection was introduced by Chartrand et al. [ 14 ] in 2008. It is interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then try to organize the work into five categories, including (strong) rainbow connection number, rainbow k -connectivity, k -rainbow index, rainbow vertex-connection number, algorithms and computational complexity. This survey also contains some conjectures, open problems and questions. The concept of rainbow connection was introduced by Chartrand et al. [14] in 2008. It is interesting and recently quite a lot papers have been published about it. In this survey we attempt to bring together most of the results and papers that dealt with it. We begin with an introduction, and then try to organize the work into five categories, including (strong) rainbow connection number, rainbow k-connectivity, k-rainbow index, rainbow vertex-connection number, algorithms and computational complexity. This survey also contains some conjectures, open problems and questions.
Author	Li, Xueliang Shi, Yongtang Sun, Yuefang
Author_xml	– sequence: 1 givenname: Xueliang surname: Li fullname: Li, Xueliang email: lxl@nankai.edu.cn organization: Center for Combinatorics and LPMC-TJKLC, Nankai University – sequence: 2 givenname: Yongtang surname: Shi fullname: Shi, Yongtang organization: Center for Combinatorics and LPMC-TJKLC, Nankai University – sequence: 3 givenname: Yuefang surname: Sun fullname: Sun, Yuefang organization: Center for Combinatorics and LPMC-TJKLC, Nankai University
BookMark	eNp9kMtKAzEUhoNUsFYfwN2AC92M5uQyF3elaBUKgpd1SNMTnTJNajKj9O2dYVxIQVdnkf_L-c93TEbOOyTkDOgVUJpfR0p5zlMKLAUmeMoOyBgEl6ksQYzImJYA3SuUR-Q4xjWlVIKgY3LxpCu39F_JzDuHpqm8i4m3yTzo7Xu8SabJcxs-cXdCDq2uI57-zAl5vbt9md2ni8f5w2y6SA0XZZPKgrJVkefZknKeo5CC2wJwZUpmpORWiqJAXFmUQjOz1JYKrTPM0JaCM8n4hFwO_26D_2gxNmpTRYN1rR36NirgILNCCFl00fO96Nq3wXXtFLAsk1neXdmlYEiZ4GMMaNU2VBsddgqo6tWpQZ3q1KlenepL5HuMqRrdu2mCrup_STaQsdvi3jD86vQn9A3u7oFX
CitedBy_id	crossref_primary_10_1007_s00373_017_1783_6 crossref_primary_10_1007_s12044_019_0549_x crossref_primary_10_1016_j_amc_2024_128981 crossref_primary_10_1016_j_tcs_2015_10_017 crossref_primary_10_1016_j_ejc_2023_103778 crossref_primary_10_3390_math12070944 crossref_primary_10_1007_s10878_017_0156_7 crossref_primary_10_1016_j_amc_2018_07_065 crossref_primary_10_1142_S0219265917410092 crossref_primary_10_1016_j_tcs_2023_113771 crossref_primary_10_1002_net_21800 crossref_primary_10_1007_s00373_013_1295_y crossref_primary_10_1016_j_amc_2022_127128 crossref_primary_10_1007_s10878_015_9938_y crossref_primary_10_1007_s00373_021_02331_8 crossref_primary_10_1007_s10878_015_9874_x crossref_primary_10_1016_j_tcs_2021_07_009 crossref_primary_10_1016_j_amc_2015_02_015 crossref_primary_10_1137_17M1149420 crossref_primary_10_1007_s11464_017_0651_2 crossref_primary_10_1016_j_amc_2014_05_066 crossref_primary_10_1007_s00373_020_02234_0 crossref_primary_10_1137_140998433 crossref_primary_10_1007_s10878_014_9815_0 crossref_primary_10_1016_j_tcs_2020_06_030 crossref_primary_10_1007_s00373_016_1704_0 crossref_primary_10_1016_j_dam_2025_05_008 crossref_primary_10_1016_j_disc_2016_02_015 crossref_primary_10_1080_00207160_2015_1047356 crossref_primary_10_1007_s12209_015_2431_y crossref_primary_10_1016_j_disc_2016_09_021 crossref_primary_10_1016_j_jcss_2021_10_001 crossref_primary_10_3390_axioms11060254 crossref_primary_10_1002_net_22031 crossref_primary_10_1016_j_amc_2017_01_068 crossref_primary_10_1155_2019_4073905 crossref_primary_10_1515_math_2022_0025 crossref_primary_10_1016_j_disc_2017_04_022 crossref_primary_10_1007_s40305_023_00498_w crossref_primary_10_1088_1742_6596_1836_1_012003 crossref_primary_10_1007_s10878_018_0307_5 crossref_primary_10_1016_j_amc_2016_05_031 crossref_primary_10_1016_j_amc_2019_05_008 crossref_primary_10_3390_math13020229 crossref_primary_10_1016_j_tcs_2015_06_006 crossref_primary_10_1137_16M1102690 crossref_primary_10_1016_j_amc_2015_09_084 crossref_primary_10_1016_j_amc_2015_11_016 crossref_primary_10_1002_net_21513 crossref_primary_10_1088_1742_6596_1127_1_012060 crossref_primary_10_1016_j_procs_2015_12_094 crossref_primary_10_3390_axioms12040353 crossref_primary_10_1007_s10878_016_0003_2 crossref_primary_10_1007_s00373_016_1723_x crossref_primary_10_1016_j_disc_2014_04_024 crossref_primary_10_1016_j_tcs_2016_04_042 crossref_primary_10_1016_j_endm_2015_06_019 crossref_primary_10_1007_s40840_025_01876_8 crossref_primary_10_1007_s10878_015_9942_2 crossref_primary_10_1016_j_amc_2017_05_020 crossref_primary_10_1002_jgt_22003 crossref_primary_10_1007_s10878_016_0056_2 crossref_primary_10_1016_j_amc_2017_05_024 crossref_primary_10_1016_j_disc_2022_112829 crossref_primary_10_1016_j_amc_2023_127843 crossref_primary_10_12677_aam_2024_1311473 crossref_primary_10_1007_s10255_022_1027_2 crossref_primary_10_1088_1742_6596_2157_1_012011 crossref_primary_10_1016_j_disc_2016_08_020 crossref_primary_10_1016_j_amc_2015_03_124 crossref_primary_10_1007_s10878_016_0048_2 crossref_primary_10_1016_j_heliyon_2024_e31426 crossref_primary_10_1007_s10114_020_0083_x crossref_primary_10_1007_s00373_018_1954_0 crossref_primary_10_1007_s10255_020_0970_z crossref_primary_10_1016_j_amc_2016_10_025 crossref_primary_10_1016_j_amc_2023_128243 crossref_primary_10_1007_s10878_018_0363_x crossref_primary_10_1016_j_amc_2024_128886 crossref_primary_10_1016_j_disc_2014_03_013 crossref_primary_10_1002_net_21700 crossref_primary_10_1016_j_disc_2012_12_014 crossref_primary_10_1016_j_amc_2019_01_062 crossref_primary_10_1007_s00373_021_02322_9 crossref_primary_10_1007_s00373_013_1369_x crossref_primary_10_1007_s00025_015_0469_8 crossref_primary_10_1007_s00373_023_02669_1 crossref_primary_10_1007_s10114_022_0642_4 crossref_primary_10_1016_j_tcs_2019_10_043 crossref_primary_10_1016_j_amc_2017_09_005 crossref_primary_10_1007_s10878_020_00541_z crossref_primary_10_1007_s00373_015_1665_8 crossref_primary_10_1007_s00373_022_02567_y crossref_primary_10_1016_j_amc_2021_126253 crossref_primary_10_1016_j_amc_2017_03_023 crossref_primary_10_1088_1742_6596_1828_1_012150 crossref_primary_10_1007_s10255_013_0247_x crossref_primary_10_1007_s10878_018_0258_x crossref_primary_10_1016_j_disc_2018_09_002
Cites_doi	10.1016/j.disc.2012.04.022 10.1016/j.camwa.2011.09.056 10.1007/s00373-011-1034-1 10.1007/978-1-4614-3119-0_8 10.1016/S0020-0190(96)00190-1 10.2307/2306658 10.1002/jgt.20418 10.7151/dmgt.1664 10.1016/S0304-3975(00)00176-6 10.1016/j.disc.2009.09.010 10.1007/BF02579198 10.1007/978-1-4614-3119-0 10.1016/0898-1221(88)90213-1 10.1360/012012-120 10.7151/dmgt.1644 10.1002/net.20296 10.1007/978-3-642-32512-0_46 10.1002/jgt.20643 10.2307/2371086 10.1016/j.ipl.2012.01.014 10.1007/s00373-012-1267-7 10.1016/j.tcs.2011.04.032 10.1016/j.disc.2012.01.009 10.1007/978-1-84628-970-5 10.21136/MB.2008.133947 10.1007/s10255-013-0247-x 10.1007/BFb0067365 10.7151/dmgt.1547 10.37236/1172 10.1007/s00373-012-1204-9 10.1007/s00373-012-1218-3 10.7151/dmgt.1640 10.1137/0603036 10.37236/781 10.1142/S1793042105000108 10.1007/BF01304873 10.1137/S0895480193250125 10.1007/s00373-012-1183-x 10.1016/0095-8956(89)90066-X 10.1002/net.3230220608 10.1090/S0002-9939-96-03732-X 10.1201/9781584888017 10.1007/978-3-642-10217-2_42 10.1002/0471722154 10.7151/dmgt.1692 10.1109/FOCS.2007.12 10.1007/978-3-642-32241-9_16 10.1006/jagm.1994.1005 10.1007/978-3-642-22685-4_8
ContentType	Journal Article
Copyright	Springer Japan 2012 Springer Japan 2013
Copyright_xml	– notice: Springer Japan 2012 – notice: Springer Japan 2013
DBID	AAYXX CITATION 3V. 7SC 7TB 7XB 88I 8AL 8AO 8FD 8FE 8FG 8FK ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO FR3 GNUQQ HCIFZ JQ2 K7- KR7 L6V L7M L~C L~D M0N M2P M7S P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U
DOI	10.1007/s00373-012-1243-2
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts ProQuest Central (purchase pre-March 2016) Science Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Materials Science & Engineering ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology Collection ProQuest One ProQuest Central Engineering Research Database ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Civil Engineering Abstracts ProQuest Engineering Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Science Database Engineering Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering collection ProQuest Central Basic
DatabaseTitle	CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) Mechanical & Transportation Engineering Abstracts ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Engineering Collection ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Engineering Collection Advanced Technologies & Aerospace Collection Civil Engineering Abstracts ProQuest Computing Engineering Database ProQuest Science Journals (Alumni Edition) ProQuest Central Basic ProQuest Science Journals ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition Materials Science & Engineering Collection Engineering Research Database ProQuest One Academic ProQuest Central (Alumni) ProQuest One Academic (New)
DatabaseTitleList	Computer Science Database Civil Engineering Abstracts
Database_xml	– sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Mathematics
EISSN	1435-5914
EndPage	38
ExternalDocumentID	2858066911 10_1007_s00373_012_1243_2
Genre	Feature
GroupedDBID	-52 -5D -5G -BR -EM -Y2 -~C -~X .86 .VR 06D 0R~ 0VY 1N0 1SB 203 28- 29I 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 8TC 95- 95. 95~ 96X AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACGOD ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFFNX AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. B0M BA0 BAPOH BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EAD EAP EBLON EBS EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAS LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P9R PF0 PQQKQ PT4 PT5 Q2X QOK QOS R4E R89 R9I RHV RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCLPG SDD SDH SDM SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WIP WK8 YLTOR Z45 Z7U Z7X Z83 Z87 Z88 Z8O Z8R Z8W Z91 ZMTXR ZWQNP ~8M ~A9 ~EX 88I 8AO AAPKM AAYXX ABBRH ABDBE ABFSG ABJCF ABRTQ ABUWG ACSTC ADHKG AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP AMVHM ARAPS ATHPR AYFIA AZQEC BENPR BGLVJ CCPQU CITATION DWQXO GNUQQ HCIFZ K7- M2P M7S PHGZM PHGZT PQGLB PTHSS 3V. 7SC 7TB 7XB 8AL 8FD 8FE 8FG 8FK FR3 JQ2 KR7 L6V L7M L~C L~D M0N P62 PKEHL PQEST PQUKI PRINS Q9U
ID	FETCH-LOGICAL-c349t-5802d8776b0337e4543f81edc92c553f5488eedfe54a2cbaf04aa6e6ef9432523
IEDL.DBID	M2P
ISICitedReferencesCount	195
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000312554300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0911-0119
IngestDate	Sun Sep 28 02:42:38 EDT 2025 Wed Sep 17 13:51:35 EDT 2025 Sat Nov 29 03:58:06 EST 2025 Tue Nov 18 21:35:37 EST 2025 Fri Feb 21 02:34:52 EST 2025
IsPeerReviewed	true
IsScholarly	true
Issue	1
Keywords	68Q25 (Strong) rainbow connection number 05D40 05C40 Rainbow path Algorithm Computational complexity Rainbow vertex-connection number connectivity Rainbow 68R10 rainbow index 05C35 05C15
Language	English
License	http://www.springer.com/tdm
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c349t-5802d8776b0337e4543f81edc92c553f5488eedfe54a2cbaf04aa6e6ef9432523
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23
PQID	1266567000
PQPubID	30813
PageCount	38
ParticipantIDs	proquest_miscellaneous_1315684458 proquest_journals_1266567000 crossref_primary_10_1007_s00373_012_1243_2 crossref_citationtrail_10_1007_s00373_012_1243_2 springer_journals_10_1007_s00373_012_1243_2
PublicationCentury	2000
PublicationDate	20130100 2013-1-00 20130101
PublicationDateYYYYMMDD	2013-01-01
PublicationDate_xml	– month: 1 year: 2013 text: 20130100
PublicationDecade	2010
PublicationPlace	Japan
PublicationPlace_xml	– name: Japan – name: Tokyo
PublicationTitle	Graphs and combinatorics
PublicationTitleAbbrev	Graphs and Combinatorics
PublicationYear	2013
Publisher	Springer Japan Springer Nature B.V
Publisher_xml	– name: Springer Japan – name: Springer Nature B.V
References	ChandranL.S.DasA.RajendraprasadD.VarmaN.M.Rainbow connection number and connected dominating setsJ. Graph Theory2012712062181248.0509810.1002/jgt.20643 Huang, X., Li X., Shi, Y.: Rainbow connection for planar graphs and line graphs. arXiv:1110.3147 [cs.CC] (2011) Bondy, J.A., Murty, U.S.R.: Graph Theory. GTM 244, Springer, Berlin (2008) Frieze, A., Tsourakakis, C.E.: Rainbow connectivity of sparse random graphs. arXiv:1201.4603v2 [math.CO] (2012) Dong, J., Li, X.: Sharp upper bound for the rainbow connection number of a graph with diameter 2. arXiv:1106.1258v3 [math.CO] (2011) Chartrand, G., Zhang, P.: Chromatic Graph Theory. Chapman & Hall, London (2008) LiX.SunY.Rainbow connection numbers of complementary graphsUtil. Math.2011862331288317206052148 Komlós, J., Simonovits, M.: Szemerédi’s Regularity Lemma and its applications in graph theory. In: Miklós, D., Sós, V.T., Szönyi, T. (eds.) Combinatorics, Paul Erdő is Eighty, vol. 2, pp. 295–352. Bolyai Society Mathematical Studies, Budapest (1996) ChenL.LiX.ShiY.The complexity of determining the rainbow vertex-connection of graphsTheoret. Comput. Sci.20114124531453528504111223.6807910.1016/j.tcs.2011.04.032 LiH.LiX.LiuS.The (strong) rainbow connection numbers of Cayley graphs on Abelian groupsComput. Math. Appl.201162114082408828599641235.0506310.1016/j.camwa.2011.09.056 Klav̆ar, S., Mekis̆, G.: On the rainbow connection of Cartesian products and their subgraphs. Discuss. Math. Graph Theory (2012) (to appear) HeJ.LiangH.On rainbow-k-connectivity of random graphsInf. Process. Lett.20121121040641029016391243.0521810.1016/j.ipl.2012.01.014 Gologranca T., Mekiš G., Peterin I.: Rainbow connection and graph products. IMFM Preprint Series 49,–#1149 (2011) MaderW.Ecken vom Grad n in minimalen n-fach zusammenhangenden GraphenArch. Math.1972232192243060430212.2940210.1007/BF01304873 Dong, J., Li, X.: On a question on graphs with rainbow connection number 2. arXiv:1109.5004v2 [math.CO] (2011) Chandran, L.S., Rajendraprasad, D.: Rainbow colouring of split and threshold graphs COCOON. In: LNCS, vol. 7434, pp. 181–192. Springer, Berlin (2012) LiX.SunY.Rainbow connection numbers of line graphsArs Combin.2011100449463282948806093216 LiX.SunY.On the rainbow k-connectivity of complete graphsAustralasian J. Combin.2011492172261228.05196 ChenX.LiX.A solution to a conjecture on the rainbow connection numberArs Combin.20121041931962951784 ChartrandG.OkamotoF.ZhangP.Rainbow trees in graphs and generalized connectivityNetworks20105536036726663061205.05085 Hedetniemi, S.T., Slater, P.J.: Line graphs of triangleless graphs and iterated clique graphs. In: Alavi, Y. et al. (eds.) Graph Theory and Applications. Lecture Notes in Mathematics, vol. 303, , pp. 139–147. Springer, Berlin 1972; MR49#151 Li, X., Sun, Y.: Characterize graphs with rainbow connection number m – 2 and rainbow connection numbers of some graph operations. Preprint (2010) Li, X., Liu, S.: Rainbow vertex-connection number of 2-connected graphs. arXiv:1110.5770 [math.CO] (2011) Li, X., Shi, Y.: On the rainbow vertex-connection. Discuss. Math. Graph Theory (2012) (to appear) Li, X., Mao, Y., Shi, Y.: The strong rainbow vertex-connection of graphs. arXiv:1201.1541 [math.CO] (2011) CorneilD.OlariuS.StewartL.Asteroidal triple-free graphsSIAM J. Discrete Math.199710339943014599470884.0507510.1137/S0895480193250125 AlonN.DukeR.LefmannH.RödlV.YusterR.The algorithmic aspects of the Regularity LemmaJ. Algorithms199468010910.1006/jagm.1994.1005 BlumA.KargerD.An Õ (n3/14)-coloring algorithm for 3-colorable graphsInf. Process. Lett.19976114953143986710.1016/S0020-0190(96)00190-1 ChenL.LiX.LiuM.Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graphUtil. Math.201186335340288479906052174 Le, V., Tuza, Z.: Finding optimal rainbow connection is hard. Preprint (2009) Basavaraju, M., Chandran, L.S., Rajendraprasad, D., Ramaswamy, A.: Rainbow connection number of graph power and graph products. arXiv:1104.4190v1 [math.CO] (2011) KrivelevichM.YusterR.The rainbow connection of a graph is (at most) reciprocal to its minimum degreeJ. Graph Theory20096331851912590202 Basavaraju, M., Chandran, L.S., Rajendraprasad, D., Ramaswamy, A.: Rainbow connection number and radius. Graphs Combin. (2012) (to appear) ErdősP.RényiA.On the evolution of random graphsMagyar Tud. Akad. Mat. Kutato Int. Kozl.196051761125031 Kemnitz, A., Przybylo, J., Schiermeyer I., Wozniak, M.: Rainbow connection in sparse graphs. Discuss. Math. Graph Theory (2012) (to appear) Li, X., Sun, Y.: On the strong rainbow connection number. Bull. Malays. Math. Sci. Soc. (2012) (in press) BourgainJ.More on the sum-product phenomenon in prime fields and its applicationsInt. J. Number Theory2005113221723281173.1131010.1142/S1793042105000108 ElmallahE.S.ColbournC.J.Series-parallel subgraphs of planar graphsNetworks199222660761411788660766.0505110.1002/net.3230220608 Ericksen, A.: A matter of security. Graduating Engineer & Computer Careers, pp. 24–28 (2007) Li, X., Shi, Y.: Rainbow connection in 3-connected graphs. Graphs Combin. (2012) (in press) Ahadi, A., Dehghan, A.: On rainbow connection of strongly regular graphs. arXiv:1001.3413v1 [math.CO] (2010) BollobásB.ThomasonA.Threshold functionsCombinatorica19867353810.1007/BF02579198 Li, H., Li, X., Sun, Y.: Upper bound for the rainbow connection number of bridgeless graphs with diameter 3. arXiv:1109.2769v1 [math.CO] (2011) AlonN.SpencerJ.The Probabilistic Method20002New YorkWiley0996.0500110.1002/0471722154 Chen, L., Li, X., Lian, H.: Nordhaus-Gaddum-type theorem for rainbow connection number of graphs. Graphs Combin. (2012) (in press) ChartrandG.JohnsG.L.McKeonK.A.ZhangP.On the rainbow connectivity of cagesCongr. Numer.200718420922224088481138.05042 LiX.SunY.Rainbow Connections of Graphs, Springer Briefs in Mathematics2012New YorkSpringer10.1007/978-1-4614-3119-0 WhitneyH.Congruent graphs and the connectivity of graphsAm. J. Math.193254150168150688110.2307/2371086 Li, X., Liu, S.: Sharp upper bound for the rainbow connection numbers of 2-connected graphs. arXiv:1105.4210v2 [math.CO] (2011) NordhausE.A.GaddumJ.W.On complementary graphsAm. Math. Monthly195663175177786850070.1850310.2307/2306658 Hemminger, R., Beineke, L.: Line graphs and line digraphs. In: Beineke, L. et al. (eds.) Selected Topics in Graph Theory, pp. 271–305. Academic Press, London (1978) Ananth, P., Nasre, M.: New hardness results in rainbow connectivity. arXiv:1104.2074v1 [cs.CC] (2011) LiX.LiuS.ChandranL.S.MathewR.RajendraprasadD.Rainbow connection number and connectivityElectron. J. Combin.201219P202880651 Huang, X., Li, H., Li, X., Sun, Y.: Oriented diameter and rainbow connection number of a graph. arXiv:1111.3480v1 [math.CO] (2011) ImrichW.KlavzarS.Product Graphs–Structure and Recognition2000New YorkWiley0963.05002 LiX.SunY.Note on the rainbow k-connectivity of regular complete bipartite graphsArs Combin.2011101513518283893406092218 ParkJ.H.ChwaK.Y.Recursive circulants and their embeddings among hypercubesTheoret. Comput. Sci.2000244356217743870945.6800310.1016/S0304-3975(00)00176-6 DellamonicaD.JrMagnantC.MartinD.Rainbow pathsDiscrete Math.201031077478125748261209.0512810.1016/j.disc.2009.09.010 Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and algorithms for rainbow connectivity. In: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, pp. 243–254 (2009) (Also, see J. Combin. Optim. 21, 330–347 (2011)) Fujita, S., Liu, H., Magnant, C.: Rainbow k-connection in dense graphs. preprint. Available at http://www.cantab.net/users/henry.liu/maths.htm. Extended abstract in Proceedings of Euro- Combédb́b11, Electron. Notes Discrete Math. (to appear) Rotman, J.J.: An Introduction to the Theory of Groups, GTM 148, Springer, Berlin (1994) Dong, J., Li, X.: Rainbow connection numbers and the minimum degree sum of a graph. Sci. China Ser. A (2012) (to appear) ErdősP.PachJ.PollackR.TuzaZ.Radius, diameter, and minimum degreeJ. Combin. Theory, Ser. B.19894717379100771510.1016/0095-8956(89)90066-X LiX.SunYUpper bounds for the rainbow connection numbers of line graphsGraphs Combin2012282251263289164610.1007/s00373-011-1034-1 Ekstein, J., Holub, P., Kaiser, T., Kochy, M., Camachoy, S.M., Ryjáček, Z., Schiermeyer, I.: The rainbow connection number of 2-connected graphs. Discrete Math. (2012) (in press) Johns, G.L., Okamoto, F., Zhang, P.: The rainbow connectivities of small cubic graphs. Ars Combin. (2012) (to appear) Uchizawa, K., Aoki, T., Ito, T., Suzuki, A., Zhou, X.: On the rainbow connectivity of graphs: complexity and FPT algorithms. In: COCOON 2011, LNCS, vol. 6842, pp. 86–97. Springer, Berlin (2011) CaroY.LevA.RodittyY.TuzaZ.YusterR.On rainbow connectionElectron. J. Combin.200815R572398849 ChartrandG.JohnsG.L.McKeonK.A.ZhangP.Rainbow connection in graphsMath. Bohem.2008133859824001531199.05106 HararyF.HayesJ.WuH.A survey of the theory of hypercube graphsComput. Math. Appl.1988152772899492800645.0506110.1016/0898-1221(88)90213-1 Rao, A.: An exposition of Bourgain’s 2-source extractor. in: ECCCTR: Electronic Colloquium on Computational Complexity, Technical Reports (2007) Li, X., Liu, M., Schiermeyer, I.: Rainbow connection number of dense graphs. Discuss. Math. Graph Theory (2012) (to appear) Shaltiel, R.: Recent developments in explicit constructions of extractors. Bull. EATCS, 67–95 (2002) ChartrandG.JohnsG.L.McKeonK.A.ZhangP.The rainbow connectivity of a graphNetworks2009542758125482401205.0512410.1002/net.20296 Li, X., Liu, S.: A sharp upper bound for the rainbow 2-connection number of 2-connected graphs. arXiv:1204.0392 [math.CO] (2011) Dong, J., Li, X.: Rainbow connection number, bridges and radius. Graphs Combin. (2012) (in press) Fischer, E., Matsliah, A., Shapira, A.: Approximate hypergraph partitioning and applications. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 579–589 (2007) Schiermeyer, I.: Rainbow connection in graphs with minimum degree three. IWOCA 2009. In: LNCS, vol. 5874, pp. 432–437 (2009) (also see Discrete Appl. 1243_CR6 1243_CR9 D. Corneil (1243_CR24) 1997; 10 Y. Caro (1243_CR11) 2008; 15 1243_CR47 1243_CR46 1243_CR49 1243_CR1 1243_CR4 1243_CR5 X. Li (1243_CR69) 2011; 49 D. Dellamonica Jr (1243_CR25) 2010; 310 1243_CR82 L. Chen (1243_CR22) 2011; 412 X. Chen (1243_CR23) 2012; 104 1243_CR40 B. Bollobás (1243_CR8) 1986; 7 1243_CR42 J.H. Park (1243_CR77) 2000; 244 1243_CR45 G. Chartrand (1243_CR18) 2010; 55 1243_CR44 X. Li (1243_CR74) 2012 W. Mader (1243_CR75) 1972; 23 J. He (1243_CR43) 2012; 112 P. Erdős (1243_CR33) 1989; 47 1243_CR81 1243_CR80 J. Bourgain (1243_CR10) 2005; 1 1243_CR36 1243_CR35 1243_CR79 1243_CR37 1243_CR39 1243_CR72 1243_CR71 N. Alon (1243_CR2) 1994; 6 1243_CR30 X. Li (1243_CR67) 2011; 100 G. Chartrand (1243_CR17) 2009; 54 1243_CR31 1243_CR78 E.S. Elmallah (1243_CR32) 1992; 22 E.A. Nordhaus (1243_CR76) 1956; 63 L. Chen (1243_CR21) 2011; 86 1243_CR27 W. Imrich (1243_CR48) 2000 1243_CR26 X. Li (1243_CR70) 2011; 101 1243_CR29 1243_CR28 L.S. Chandran (1243_CR13) 2012; 71 1243_CR61 G. Chartrand (1243_CR16) 2007; 184 1243_CR60 1243_CR62 1243_CR65 1243_CR20 1243_CR64 1243_CR66 M. Yannakakis (1243_CR84) 1982; 3 A. Blum (1243_CR7) 1997; 61 X. Li (1243_CR63) 2012; 19 H. Li (1243_CR55) 2011; 62 A. Kemnitz (1243_CR50) 2011; 31 1243_CR58 1243_CR57 N. Alon (1243_CR3) 2000 1243_CR15 1243_CR59 P. Erdős (1243_CR34) 1960; 5 F. Harary (1243_CR41) 1988; 15 1243_CR19 E. Friedgut (1243_CR38) 1996; 124 1243_CR52 1243_CR51 1243_CR54 X. Li (1243_CR73) 2011; 86 1243_CR12 X. Li (1243_CR68) 2012; 28 G. Chartrand (1243_CR14) 2008; 133 M. Krivelevich (1243_CR53) 2009; 63 H. Li (1243_CR56) 2012; 312 H. Whitney (1243_CR83) 1932; 54
References_xml	– reference: Li, X., Sun, Y.: On the strong rainbow connection number. Bull. Malays. Math. Sci. Soc. (2012) (in press) – reference: Li, X., Liu, S.: Rainbow vertex-connection number of 2-connected graphs. arXiv:1110.5770 [math.CO] (2011) – reference: LiX.LiuS.ChandranL.S.MathewR.RajendraprasadD.Rainbow connection number and connectivityElectron. J. Combin.201219P202880651 – reference: Dong, J., Li, X.: On a question on graphs with rainbow connection number 2. arXiv:1109.5004v2 [math.CO] (2011) – reference: ParkJ.H.ChwaK.Y.Recursive circulants and their embeddings among hypercubesTheoret. Comput. Sci.2000244356217743870945.6800310.1016/S0304-3975(00)00176-6 – reference: Chen, L., Li, X., Lian, H.: Nordhaus-Gaddum-type theorem for rainbow connection number of graphs. Graphs Combin. (2012) (in press) – reference: Le, V., Tuza, Z.: Finding optimal rainbow connection is hard. Preprint (2009) – reference: Li, X., Liu, M., Schiermeyer, I.: Rainbow connection number of dense graphs. Discuss. Math. Graph Theory (2012) (to appear) – reference: Schiermeyer, I.: Rainbow connection in graphs with minimum degree three. IWOCA 2009. In: LNCS, vol. 5874, pp. 432–437 (2009) (also see Discrete Appl. Math. (in press)) – reference: BourgainJ.More on the sum-product phenomenon in prime fields and its applicationsInt. J. Number Theory2005113221723281173.1131010.1142/S1793042105000108 – reference: LiX.SunY.Rainbow connection numbers of complementary graphsUtil. Math.2011862331288317206052148 – reference: Chartrand, G., Zhang, P.: Chromatic Graph Theory. Chapman & Hall, London (2008) – reference: Li, X., Liu, S.: Sharp upper bound for the rainbow connection numbers of 2-connected graphs. arXiv:1105.4210v2 [math.CO] (2011) – reference: Li, X., Sun, Y.: Characterize graphs with rainbow connection number m – 2 and rainbow connection numbers of some graph operations. Preprint (2010) – reference: CorneilD.OlariuS.StewartL.Asteroidal triple-free graphsSIAM J. Discrete Math.199710339943014599470884.0507510.1137/S0895480193250125 – reference: YannakakisM.The complexity of the partial order dimension problemSIAM J. Alg. Discrete Methods1982333513586668600516.0600110.1137/0603036 – reference: Gologranca T., Mekiš G., Peterin I.: Rainbow connection and graph products. IMFM Preprint Series 49,–#1149 (2011) – reference: ErdősP.RényiA.On the evolution of random graphsMagyar Tud. Akad. Mat. Kutato Int. Kozl.196051761125031 – reference: Rotman, J.J.: An Introduction to the Theory of Groups, GTM 148, Springer, Berlin (1994) – reference: Bondy, J.A., Murty, U.S.R.: Graph Theory. GTM 244, Springer, Berlin (2008) – reference: Li, S., Li, X.: Note on the complexity of deciding the rainbow connectedness for bipartite graphs. arXiv:1109.5534v2 [cs.CC] (2011) – reference: Fischer, E., Matsliah, A., Shapira, A.: Approximate hypergraph partitioning and applications. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 579–589 (2007) – reference: Dong, J., Li, X.: Rainbow connection numbers and the minimum degree sum of a graph. Sci. China Ser. A (2012) (to appear) – reference: Basavaraju, M., Chandran, L.S., Rajendraprasad, D., Ramaswamy, A.: Rainbow connection number of graph power and graph products. arXiv:1104.4190v1 [math.CO] (2011) – reference: Kemnitz, A., Przybylo, J., Schiermeyer I., Wozniak, M.: Rainbow connection in sparse graphs. Discuss. Math. Graph Theory (2012) (to appear) – reference: Ekstein, J., Holub, P., Kaiser, T., Kochy, M., Camachoy, S.M., Ryjáček, Z., Schiermeyer, I.: The rainbow connection number of 2-connected graphs. Discrete Math. (2012) (in press) – reference: Dong, J., Li, X.: Rainbow connection number, bridges and radius. Graphs Combin. (2012) (in press) – reference: BlumA.KargerD.An Õ (n3/14)-coloring algorithm for 3-colorable graphsInf. Process. Lett.19976114953143986710.1016/S0020-0190(96)00190-1 – reference: Ericksen, A.: A matter of security. Graduating Engineer & Computer Careers, pp. 24–28 (2007) – reference: Komlós, J., Simonovits, M.: Szemerédi’s Regularity Lemma and its applications in graph theory. In: Miklós, D., Sós, V.T., Szönyi, T. (eds.) Combinatorics, Paul Erdő is Eighty, vol. 2, pp. 295–352. Bolyai Society Mathematical Studies, Budapest (1996) – reference: Hemminger, R., Beineke, L.: Line graphs and line digraphs. In: Beineke, L. et al. (eds.) Selected Topics in Graph Theory, pp. 271–305. Academic Press, London (1978) – reference: ImrichW.KlavzarS.Product Graphs–Structure and Recognition2000New YorkWiley0963.05002 – reference: Li, X., Mao, Y., Shi, Y.: The strong rainbow vertex-connection of graphs. arXiv:1201.1541 [math.CO] (2011) – reference: ChandranL.S.DasA.RajendraprasadD.VarmaN.M.Rainbow connection number and connected dominating setsJ. Graph Theory2012712062181248.0509810.1002/jgt.20643 – reference: HeJ.LiangH.On rainbow-k-connectivity of random graphsInf. Process. Lett.20121121040641029016391243.0521810.1016/j.ipl.2012.01.014 – reference: Johns, G.L., Okamoto, F., Zhang, P.: The rainbow connectivities of small cubic graphs. Ars Combin. (2012) (to appear) – reference: Huang, X., Li, H., Li, X., Sun, Y.: Oriented diameter and rainbow connection number of a graph. arXiv:1111.3480v1 [math.CO] (2011) – reference: Huang, X., Li X., Shi, Y.: Rainbow connection for planar graphs and line graphs. arXiv:1110.3147 [cs.CC] (2011) – reference: Dong, J., Li, X.: Sharp upper bound for the rainbow connection number of a graph with diameter 2. arXiv:1106.1258v3 [math.CO] (2011) – reference: ChenL.LiX.LiuM.Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graphUtil. Math.201186335340288479906052174 – reference: DellamonicaD.JrMagnantC.MartinD.Rainbow pathsDiscrete Math.201031077478125748261209.0512810.1016/j.disc.2009.09.010 – reference: CaroY.LevA.RodittyY.TuzaZ.YusterR.On rainbow connectionElectron. J. Combin.200815R572398849 – reference: Li, X., Shi, Y.: Rainbow connection in 3-connected graphs. Graphs Combin. (2012) (in press) – reference: Rao, A.: An exposition of Bourgain’s 2-source extractor. in: ECCCTR: Electronic Colloquium on Computational Complexity, Technical Reports (2007) – reference: LiX.SunY.Rainbow connection numbers of line graphsArs Combin.2011100449463282948806093216 – reference: ErdősP.PachJ.PollackR.TuzaZ.Radius, diameter, and minimum degreeJ. Combin. Theory, Ser. B.19894717379100771510.1016/0095-8956(89)90066-X – reference: LiH.LiX.LiuS.Rainbow connection in graphs with diameter 2Discrete Math.201231281453145728895021237.0511810.1016/j.disc.2012.01.009 – reference: ChartrandG.OkamotoF.ZhangP.Rainbow trees in graphs and generalized connectivityNetworks20105536036726663061205.05085 – reference: Ananth, P., Nasre, M.: New hardness results in rainbow connectivity. arXiv:1104.2074v1 [cs.CC] (2011) – reference: Fujita, S., Liu, H., Magnant, C.: Rainbow k-connection in dense graphs. preprint. Available at http://www.cantab.net/users/henry.liu/maths.htm. Extended abstract in Proceedings of Euro- Combédb́b11, Electron. Notes Discrete Math. (to appear) – reference: LiX.SunYUpper bounds for the rainbow connection numbers of line graphsGraphs Combin2012282251263289164610.1007/s00373-011-1034-1 – reference: Li, X., Liu, S.: A sharp upper bound for the rainbow 2-connection number of 2-connected graphs. arXiv:1204.0392 [math.CO] (2011) – reference: LiX.SunY.Rainbow Connections of Graphs, Springer Briefs in Mathematics2012New YorkSpringer10.1007/978-1-4614-3119-0 – reference: LiX.SunY.On the rainbow k-connectivity of complete graphsAustralasian J. Combin.2011492172261228.05196 – reference: ChartrandG.JohnsG.L.McKeonK.A.ZhangP.Rainbow connection in graphsMath. Bohem.2008133859824001531199.05106 – reference: Frieze, A., Tsourakakis, C.E.: Rainbow connectivity of sparse random graphs. arXiv:1201.4603v2 [math.CO] (2012) – reference: Klav̆ar, S., Mekis̆, G.: On the rainbow connection of Cartesian products and their subgraphs. Discuss. Math. Graph Theory (2012) (to appear) – reference: Uchizawa, K., Aoki, T., Ito, T., Suzuki, A., Zhou, X.: On the rainbow connectivity of graphs: complexity and FPT algorithms. In: COCOON 2011, LNCS, vol. 6842, pp. 86–97. Springer, Berlin (2011) – reference: Li, H., Li, X., Sun, Y.: Upper bound for the rainbow connection number of bridgeless graphs with diameter 3. arXiv:1109.2769v1 [math.CO] (2011) – reference: BollobásB.ThomasonA.Threshold functionsCombinatorica19867353810.1007/BF02579198 – reference: Dong, J., Li, X.: Upper bounds involving parameter σ2 for the rainbow connection. Acta Math. Appl. Sin. (2012) (to appear) – reference: ChartrandG.JohnsG.L.McKeonK.A.ZhangP.On the rainbow connectivity of cagesCongr. Numer.200718420922224088481138.05042 – reference: Ahadi, A., Dehghan, A.: On rainbow connection of strongly regular graphs. arXiv:1001.3413v1 [math.CO] (2010) – reference: AlonN.SpencerJ.The Probabilistic Method20002New YorkWiley0996.0500110.1002/0471722154 – reference: LiX.SunY.Note on the rainbow k-connectivity of regular complete bipartite graphsArs Combin.2011101513518283893406092218 – reference: Shaltiel, R.: Recent developments in explicit constructions of extractors. Bull. EATCS, 67–95 (2002) – reference: Li, X., Shi, Y.: On the rainbow vertex-connection. Discuss. Math. Graph Theory (2012) (to appear) – reference: FriedgutE.KalaiG.Every monotone graph property has a sharp thresholdProc. Am. Math. Soc.19961242993300213711230864.0507810.1090/S0002-9939-96-03732-X – reference: HararyF.HayesJ.WuH.A survey of the theory of hypercube graphsComput. Math. Appl.1988152772899492800645.0506110.1016/0898-1221(88)90213-1 – reference: NordhausE.A.GaddumJ.W.On complementary graphsAm. Math. Monthly195663175177786850070.1850310.2307/2306658 – reference: ChartrandG.JohnsG.L.McKeonK.A.ZhangP.The rainbow connectivity of a graphNetworks2009542758125482401205.0512410.1002/net.20296 – reference: WhitneyH.Congruent graphs and the connectivity of graphsAm. J. Math.193254150168150688110.2307/2371086 – reference: MaderW.Ecken vom Grad n in minimalen n-fach zusammenhangenden GraphenArch. Math.1972232192243060430212.2940210.1007/BF01304873 – reference: AlonN.DukeR.LefmannH.RödlV.YusterR.The algorithmic aspects of the Regularity LemmaJ. Algorithms199468010910.1006/jagm.1994.1005 – reference: Chandran, L.S., Rajendraprasad, D.: Rainbow colouring of split and threshold graphs COCOON. In: LNCS, vol. 7434, pp. 181–192. Springer, Berlin (2012) – reference: LiH.LiX.LiuS.The (strong) rainbow connection numbers of Cayley graphs on Abelian groupsComput. Math. Appl.201162114082408828599641235.0506310.1016/j.camwa.2011.09.056 – reference: Basavaraju, M., Chandran, L.S., Rajendraprasad, D., Ramaswamy, A.: Rainbow connection number and radius. Graphs Combin. (2012) (to appear) – reference: ElmallahE.S.ColbournC.J.Series-parallel subgraphs of planar graphsNetworks199222660761411788660766.0505110.1002/net.3230220608 – reference: Hedetniemi, S.T., Slater, P.J.: Line graphs of triangleless graphs and iterated clique graphs. In: Alavi, Y. et al. (eds.) Graph Theory and Applications. Lecture Notes in Mathematics, vol. 303, , pp. 139–147. Springer, Berlin 1972; MR49#151 – reference: ChenL.LiX.ShiY.The complexity of determining the rainbow vertex-connection of graphsTheoret. Comput. Sci.20114124531453528504111223.6807910.1016/j.tcs.2011.04.032 – reference: KrivelevichM.YusterR.The rainbow connection of a graph is (at most) reciprocal to its minimum degreeJ. Graph Theory20096331851912590202 – reference: ChenX.LiX.A solution to a conjecture on the rainbow connection numberArs Combin.20121041931962951784 – reference: Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and algorithms for rainbow connectivity. In: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, pp. 243–254 (2009) (Also, see J. Combin. Optim. 21, 330–347 (2011)) – reference: KemnitzA.SchiermeyerI.Graphs with rainbow connection number twoDiscuss. Math. Graph Theory20113131332028656611234.0509210.7151/dmgt.1547 – ident: 1243_CR1 – ident: 1243_CR12 – ident: 1243_CR31 doi: 10.1016/j.disc.2012.04.022 – ident: 1243_CR39 – volume: 62 start-page: 4082 issue: 11 year: 2011 ident: 1243_CR55 publication-title: Comput. Math. Appl. doi: 10.1016/j.camwa.2011.09.056 – ident: 1243_CR58 – ident: 1243_CR35 – ident: 1243_CR60 – volume: 28 start-page: 251 issue: 2 year: 2012 ident: 1243_CR68 publication-title: Graphs Combin doi: 10.1007/s00373-011-1034-1 – ident: 1243_CR72 doi: 10.1007/978-1-4614-3119-0_8 – volume-title: Product Graphs–Structure and Recognition year: 2000 ident: 1243_CR48 – volume: 61 start-page: 49 issue: 1 year: 1997 ident: 1243_CR7 publication-title: Inf. Process. Lett. doi: 10.1016/S0020-0190(96)00190-1 – volume: 63 start-page: 175 year: 1956 ident: 1243_CR76 publication-title: Am. Math. Monthly doi: 10.2307/2306658 – volume: 63 start-page: 185 issue: 3 year: 2009 ident: 1243_CR53 publication-title: J. Graph Theory doi: 10.1002/jgt.20418 – ident: 1243_CR65 doi: 10.7151/dmgt.1664 – volume: 5 start-page: 17 year: 1960 ident: 1243_CR34 publication-title: Magyar Tud. Akad. Mat. Kutato Int. Kozl. – volume: 244 start-page: 35 year: 2000 ident: 1243_CR77 publication-title: Theoret. Comput. Sci. doi: 10.1016/S0304-3975(00)00176-6 – ident: 1243_CR49 – volume: 310 start-page: 774 year: 2010 ident: 1243_CR25 publication-title: Discrete Math. doi: 10.1016/j.disc.2009.09.010 – volume: 7 start-page: 35 year: 1986 ident: 1243_CR8 publication-title: Combinatorica doi: 10.1007/BF02579198 – volume-title: Rainbow Connections of Graphs, Springer Briefs in Mathematics year: 2012 ident: 1243_CR74 doi: 10.1007/978-1-4614-3119-0 – ident: 1243_CR45 – volume: 184 start-page: 209 year: 2007 ident: 1243_CR16 publication-title: Congr. Numer. – volume: 15 start-page: 277 year: 1988 ident: 1243_CR41 publication-title: Comput. Math. Appl. doi: 10.1016/0898-1221(88)90213-1 – ident: 1243_CR78 – ident: 1243_CR28 doi: 10.1360/012012-120 – ident: 1243_CR42 doi: 10.7151/dmgt.1644 – volume: 54 start-page: 75 issue: 2 year: 2009 ident: 1243_CR17 publication-title: Networks doi: 10.1002/net.20296 – ident: 1243_CR37 doi: 10.1007/978-3-642-32512-0_46 – volume: 71 start-page: 206 year: 2012 ident: 1243_CR13 publication-title: J. Graph Theory doi: 10.1002/jgt.20643 – ident: 1243_CR57 – volume: 54 start-page: 150 year: 1932 ident: 1243_CR83 publication-title: Am. J. Math. doi: 10.2307/2371086 – ident: 1243_CR4 – volume: 112 start-page: 406 issue: 10 year: 2012 ident: 1243_CR43 publication-title: Inf. Process. Lett. doi: 10.1016/j.ipl.2012.01.014 – volume: 104 start-page: 193 year: 2012 ident: 1243_CR23 publication-title: Ars Combin. – ident: 1243_CR5 doi: 10.1007/s00373-012-1267-7 – ident: 1243_CR61 doi: 10.1007/978-1-4614-3119-0_8 – volume: 412 start-page: 4531 year: 2011 ident: 1243_CR22 publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2011.04.032 – ident: 1243_CR52 – ident: 1243_CR29 – ident: 1243_CR46 – volume: 312 start-page: 1453 issue: 8 year: 2012 ident: 1243_CR56 publication-title: Discrete Math. doi: 10.1016/j.disc.2012.01.009 – ident: 1243_CR9 doi: 10.1007/978-1-84628-970-5 – ident: 1243_CR71 doi: 10.1007/s00373-011-1034-1 – volume: 133 start-page: 85 year: 2008 ident: 1243_CR14 publication-title: Math. Bohem. doi: 10.21136/MB.2008.133947 – ident: 1243_CR26 doi: 10.1007/s10255-013-0247-x – ident: 1243_CR44 doi: 10.1007/BFb0067365 – volume: 31 start-page: 313 year: 2011 ident: 1243_CR50 publication-title: Discuss. Math. Graph Theory doi: 10.7151/dmgt.1547 – volume: 19 start-page: P20 year: 2012 ident: 1243_CR63 publication-title: Electron. J. Combin. doi: 10.37236/1172 – ident: 1243_CR66 doi: 10.1007/s00373-012-1204-9 – ident: 1243_CR27 doi: 10.1007/s00373-012-1218-3 – ident: 1243_CR51 doi: 10.7151/dmgt.1640 – ident: 1243_CR81 – volume: 3 start-page: 351 issue: 3 year: 1982 ident: 1243_CR84 publication-title: SIAM J. Alg. Discrete Methods doi: 10.1137/0603036 – ident: 1243_CR62 – volume: 49 start-page: 217 year: 2011 ident: 1243_CR69 publication-title: Australasian J. Combin. – volume: 15 start-page: R57 year: 2008 ident: 1243_CR11 publication-title: Electron. J. Combin. doi: 10.37236/781 – volume: 86 start-page: 23 year: 2011 ident: 1243_CR73 publication-title: Util. Math. – volume: 1 start-page: 1 year: 2005 ident: 1243_CR10 publication-title: Int. J. Number Theory doi: 10.1142/S1793042105000108 – ident: 1243_CR47 – volume: 23 start-page: 219 year: 1972 ident: 1243_CR75 publication-title: Arch. Math. doi: 10.1007/BF01304873 – volume: 10 start-page: 399 issue: 3 year: 1997 ident: 1243_CR24 publication-title: SIAM J. Discrete Math. doi: 10.1137/S0895480193250125 – ident: 1243_CR20 doi: 10.1007/s00373-012-1183-x – volume: 47 start-page: 73 issue: 1 year: 1989 ident: 1243_CR33 publication-title: J. Combin. Theory, Ser. B. doi: 10.1016/0095-8956(89)90066-X – volume: 22 start-page: 607 issue: 6 year: 1992 ident: 1243_CR32 publication-title: Networks doi: 10.1002/net.3230220608 – volume: 124 start-page: 2993 year: 1996 ident: 1243_CR38 publication-title: Proc. Am. Math. Soc. doi: 10.1090/S0002-9939-96-03732-X – ident: 1243_CR40 – ident: 1243_CR19 doi: 10.1201/9781584888017 – ident: 1243_CR80 doi: 10.1007/978-3-642-10217-2_42 – volume-title: The Probabilistic Method year: 2000 ident: 1243_CR3 doi: 10.1002/0471722154 – ident: 1243_CR6 – ident: 1243_CR30 – volume: 55 start-page: 360 year: 2010 ident: 1243_CR18 publication-title: Networks – ident: 1243_CR59 doi: 10.7151/dmgt.1692 – volume: 100 start-page: 449 year: 2011 ident: 1243_CR67 publication-title: Ars Combin. – volume: 101 start-page: 513 year: 2011 ident: 1243_CR70 publication-title: Ars Combin. – volume: 86 start-page: 335 year: 2011 ident: 1243_CR21 publication-title: Util. Math. – ident: 1243_CR54 – ident: 1243_CR64 doi: 10.1007/978-1-4614-3119-0_8 – ident: 1243_CR36 doi: 10.1109/FOCS.2007.12 – ident: 1243_CR79 – ident: 1243_CR15 doi: 10.1007/978-3-642-32241-9_16 – volume: 6 start-page: 80 year: 1994 ident: 1243_CR2 publication-title: J. Algorithms doi: 10.1006/jagm.1994.1005 – ident: 1243_CR82 doi: 10.1007/978-3-642-22685-4_8
SSID	ssj0005140
Score	2.4250333
Snippet	The concept of rainbow connection was introduced by Chartrand et al. [ 14 ] in 2008. It is interesting and recently quite a lot papers have been published... The concept of rainbow connection was introduced by Chartrand et al. [ 14 ] in 2008. It is interesting and recently quite a lot papers have been published... The concept of rainbow connection was introduced by Chartrand et al. [14] in 2008. It is interesting and recently quite a lot papers have been published about...
SourceID	proquest crossref springer
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	1
SubjectTerms	Algorithms Categories Combinatorial analysis Combinatorics Complexity Computation Computational mathematics Engineering Design Graph algorithms Graph theory Graphs Joints Mathematics Mathematics and Statistics Rainbows Survey
SummonAdditionalLinks	– databaseName: SpringerLINK Contemporary 1997-Present dbid: RSV link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS8MwED9k-qAPfovVKRUEQSm0TZqmvg1x-qBDmMreSpomIIxO1m3gf-8lazsVFRT6dmla7i65O-7udwCnxmhSrkxxa8YwQPGlJ7gUnkJTo3KOT2bR9e_iXo8PBslD1cdd1tXudUrS3tRNs5uBSjG1P2YYByUe3rvLkQGbMSF6_3lR1zHvgkQ7aOLkIKlTmd9t8dkYLTzML0lRa2u6G__6y01Yr1xLtzPXhS1YUsU2rN03uKzlDpxV6RzX1rfYlobSHWn3xsBWl5dux-1PxzP1tgtP3evHq1uvGpXgSUKTiRdxP8x5HLPMJyRWNKJE80DlMgllFBGN8uBoDbWKqAhlJrRPhWCKKZ1QEmIwugetYlSofXCRyjmTgU64TyXLM0oJ1UyRQAmic-GAX_MslRWOuBlnMUwbBGTLgxR5kBoepKED580rr3MQjd8Wt2tBpNV5KpHE0PGMUbwOnDRkPAkmvSEKNZriGoKxKKc04g5c1ML5sMVPHzz40-pDWA3tRAyjXW1oTcZTdQQrcjZ5KcfHVhXfAWrG1Pg priority: 102 providerName: Springer Nature
Title	Rainbow Connections of Graphs: A Survey
URI	https://link.springer.com/article/10.1007/s00373-012-1243-2 https://www.proquest.com/docview/1266567000 https://www.proquest.com/docview/1315684458
Volume	29
WOSCitedRecordID	wos000312554300001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1435-5914 dateEnd: 20161231 omitProxy: false ssIdentifier: ssj0005140 issn: 0911-0119 databaseCode: K7- dateStart: 20020301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1435-5914 dateEnd: 20161231 omitProxy: false ssIdentifier: ssj0005140 issn: 0911-0119 databaseCode: M7S dateStart: 20020301 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest advanced technologies & aerospace journals customDbUrl: eissn: 1435-5914 dateEnd: 20161231 omitProxy: false ssIdentifier: ssj0005140 issn: 0911-0119 databaseCode: P5Z dateStart: 20020301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1435-5914 dateEnd: 20161231 omitProxy: false ssIdentifier: ssj0005140 issn: 0911-0119 databaseCode: BENPR dateStart: 20020301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Science Database customDbUrl: eissn: 1435-5914 dateEnd: 20161231 omitProxy: false ssIdentifier: ssj0005140 issn: 0911-0119 databaseCode: M2P dateStart: 20020301 isFulltext: true titleUrlDefault: https://search.proquest.com/sciencejournals providerName: ProQuest – providerCode: PRVAVX databaseName: SpringerLink Contemporary customDbUrl: eissn: 1435-5914 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0005140 issn: 0911-0119 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED_c5oM--C1O56ggCEqxbdI29UWmbAq6MTaV4UtJ0wQE6ea6DfzvTbK2U8G9COVekjbl8vHL5S6_AzhVoIkJV8GtkScNFIuZlDBqcgk1PCbyiTS7_qPf6ZDBIOhmB25pFlaZr4l6oY6HTJ2RX9oSSVx1p8S6Hn2YKmuU8q5mKTRKUJE7G1uFdLWd7iLEY34hUkKiMpntIPdqWppEFPkqkkil9sDIdH7i0mKz-cs_qmGntfnfH96CjWzDaTTmI2QbVniyA-vtgq013YWzzMlj6KgXfdEhNYbCuFNk1umV0TD60_GMf-7Bc6v5dHtvZgkUTIZwMDFdYjkx8X0vshDyOXYxEsTmMQsc5rpIyF4iEiMFdzF1WESFhSn1uMdFgJEjTdR9KCfDhB-AIUsJ8ZgtAmJh5sURxggLjyObUyRiWgUrV1_IMnZxleTiPSx4kbXGQ6nxUGk8dKpwXrwymlNrLKtcy7UcZrMsDRcqrsJJUSznh3J60IQPp7IOkhYqwdglVbjI-_LbJ_5q8HB5g0ew5ujEGGpk1aA8GU_5Mayy2eQtHdehctPsdHt1KD34Zl0PSiX9vpRd91XKXv_lCw_w5Rw
linkProvider	ProQuest
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3dS8MwED9EBfXBb3F-VlAEpdgmaZsKIuI3m0NQwbeapgkIss11U_yn_BvNZe2mgr75IPQtaRN6X7nc3e8ANtFoMq4wuTUNjYPiSVdwKVxlTI3KuHlSi65fi-p1fn8fXw_Be1kLg2mVpU60ijprSrwj3_ONJQmwpsQ7bD272DUKo6tlC40eW1TV26tx2fKDyxND3y1Czk5vjy_coquAKymLO27APZLxKApTj9JIsYBRzX2VyZjIIKDabJ0bw6FVwASRqdAeEyJUodIxoyRAoAOj8kcY5SFKVDVyByklvQJMY4LRRffjMorqWdBSGmHmErYSYdQlX-3g4HD7LR5rzdzZ1H_7QdMwWRyonaOeBMzAkGrMwsRVH402n4PtIojl2KweW8iRO03tnCNYd77vHDk33faLepuHuz_Z6QIMN5oNtQiOGeU8lL6OucdkmKWMUaZDRX0lqM5EBbySXIks0NOxicdT0sd9thRODIUTpHBCKrDTf6XVgw75bfJKSdWk0CJ5MiBpBTb6w0b-MagjGqrZNXOo8cA5YwGvwG7JO58-8dOCS78vuA5jF7dXtaR2Wa8uwzixTUCQq1dguNPuqlUYlS-dx7y9ZkXAgYe_ZqkPClw8Sg
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8NADA8yRfTBb3E6tYIgKGVt79pefRvqVJxjOJW9lev1DgTpxroN_O_NdW2nooIIfcvdtSS5JiHJLwDH2mhSJnVxa-RhgGIJkzPBTYmmRsYMnyhD12_57Tbr9YJOPuc0Lardi5TktKdBozQlo_ogVvWy8U3Dpug6ID2YgxIT_8HzFAMZXdP10H2e1XhMOyLRJuqY2Q6KtOZ3R3w2TDNv80uCNLM7zdV_f_EarOQup9GY6sg6zMlkA5bvS7zWdBNO8jSPkdW9ZK0OqdFXxrWGs07PjYbRHQ8n8m0LnppXjxc3Zj5CwRSEBiPTZZYTM9_3IosQX1KXEsVsGYvAEa5LFMqJoZVU0qXcERFXFuXck55UASUOBqnbUEn6idwBA6mMecJWAbOo8OKIUkKVJ4ktOVExr4JV8C8UOb64HnPxGpbIyBkPQuRBqHkQOlU4LbcMpuAavy2uFUIJ83uWIslDh9RHUVfhqCTjDdFpD57I_hjXEIxRGaUuq8JZIagPR_z0wt0_rT6Exc5lM2zdtu_2YMnJhmZopatBZTQcy31YEJPRSzo8yDT0HUYu4MA
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Rainbow+Connections+of+Graphs%3A+A+Survey&rft.jtitle=Graphs+and+combinatorics&rft.au=Li%2C+Xueliang&rft.au=Shi%2C+Yongtang&rft.au=Sun%2C+Yuefang&rft.date=2013-01-01&rft.issn=0911-0119&rft.eissn=1435-5914&rft.volume=29&rft.issue=1&rft.spage=1&rft.epage=38&rft_id=info:doi/10.1007%2Fs00373-012-1243-2&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s00373_012_1243_2
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0911-0119&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0911-0119&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0911-0119&client=summon