{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T07:13:18Z","timestamp":1717917198368},"reference-count":39,"publisher":"Informa UK Limited","issue":"7","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2016,7,2]]},"DOI":"10.1080\/00207160.2015.1047356","type":"journal-article","created":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T14:49:47Z","timestamp":1432738187000},"page":"1078-1092","update-policy":"http:\/\/dx.doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":5,"title":["Rainbow vertex-connection and graph products"],"prefix":"10.1080","volume":"93","author":[{"given":"Yaping","family":"Mao","sequence":"first","affiliation":[]},{"given":"Fengnan","family":"Yanling","sequence":"additional","affiliation":[]},{"given":"Zhao","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Chengfu","family":"Ye","sequence":"additional","affiliation":[]}],"member":"301","published-online":{"date-parts":[[2015,6,2]]},"reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-011-1031-4"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(97)00100-5"},{"key":"CIT0003","unstructured":"M. Basavaraju, L.S. Chandran, D. Rajendraprasad, and A. Ramaswamy,Rainbow connection number of graph power and graph product, arXiv: 1104.4190 [math.CO], 2011."},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5"},{"key":"CIT0005","first-page":"45","volume":"41","author":"Bre\u0161ar B.","year":"2008","journal-title":"Austral. J. Combin."},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019528993X"},{"key":"CIT0007","doi-asserted-by":"crossref","first-page":"R57","DOI":"10.37236\/781","volume":"15","author":"Caro Y.","year":"2008","journal-title":"Electron. J. Combin."},{"key":"CIT0008","unstructured":"S. Chakraborty, E. Fischer, A. Matsliah, and R. Yuster,Hardness and algorithms for rainbow connectivity, 26th International Symposium on Theoretical Aspects of Computer Science STACS (2009), Freiburg, 243\u2013254. Also, seeJ. Combin. Optim.21(2011), 330\u2013347."},{"key":"CIT0009","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"133","author":"Chartrand G.","year":"2008","journal-title":"Math. Bohem."},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1002\/net.20296"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.04.032"},{"key":"CIT0012","doi-asserted-by":"publisher","DOI":"10.1155\/1995\/95759"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1109\/71.577251"},{"key":"CIT0014","first-page":"24","author":"Ericksen A.","year":"2007","journal-title":"Graduating Engineer & Computer Careers"},{"key":"CIT0015","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.0012"},{"key":"CIT0016","first-page":"201","volume":"74","author":"Ghidewon A.A.","year":"2005","journal-title":"Ars. Combin."},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2009.03.008"},{"key":"CIT0019","doi-asserted-by":"crossref","DOI":"10.1201\/b10959","volume-title":"Handbook of product graphs","author":"Hammack R.","year":"2011","edition":"2"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90016-8"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1057"},{"key":"CIT0022","doi-asserted-by":"publisher","DOI":"10.1109\/12.29465"},{"key":"CIT0023","first-page":"193","volume":"81","author":"Kim S.R.","year":"1991","journal-title":"Congr. Numer."},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1644"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1142\/S1793557108000102"},{"key":"CIT0026","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","volume":"63","author":"Krivelevich M.","year":"2009","journal-title":"J. Graph Theory"},{"key":"CIT0027","unstructured":"M. Krivelevich and R. Yuster,The rainbow connection of a graph is (at most) reciprocal to its minimum degree three, IWOCA 2009, LNCS 5874(2009), 432\u2013437."},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1189580"},{"key":"CIT0029","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.06.017"},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1664"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3119-0"},{"key":"CIT0032","first-page":"213","volume":"93","author":"Li X.","year":"2014","journal-title":"Util. Math."},{"key":"CIT0033","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-012-1243-2"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2014.987762"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20265"},{"key":"CIT0036","unstructured":"I. Schiermeyer,Rainbow connection in graphs with minimum degree three, IWOCA 2009, LNCS 5874 (2009), 435\u2013437."},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.1553"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1007\/s00373-010-0919-8"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1962-0133816-6"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20338"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160.2015.1047356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T06:54:07Z","timestamp":1717916047000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/full\/10.1080\/00207160.2015.1047356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,2]]},"references-count":39,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2015,9,4]]},"published-print":{"date-parts":[[2016,7,2]]}},"alternative-id":["10.1080\/00207160.2015.1047356"],"URL":"https:\/\/doi.org\/10.1080\/00207160.2015.1047356","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,2]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gcom20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"}]}}