{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T21:38:51Z","timestamp":1777066731978,"version":"3.51.4"},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,5,1]],"date-time":"2015-05-01T00:00:00Z","timestamp":1430438400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11301480"],"award-info":[{"award-number":["11301480"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["11371205"],"award-info":[{"award-number":["11371205"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation of Ningbo, China","award":["2014A610030"],"award-info":[{"award-number":["2014A610030"]}]},{"name":"Natural Science Foundation of Ningbo, China","award":["2014A610022"],"award-info":[{"award-number":["2014A610022"]}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"PCSIRT"},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Mathematics and Computation"],"published-print":{"date-parts":[[2015,5]]},"DOI":"10.1016\/j.amc.2015.02.015","type":"journal-article","created":{"date-parts":[[2015,2,24]],"date-time":"2015-02-24T11:46:58Z","timestamp":1424778418000},"page":"155-161","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs"],"prefix":"10.1016","volume":"258","author":[{"given":"Shasha","family":"Li","sequence":"first","affiliation":[]},{"given":"Xueliang","family":"Li","sequence":"additional","affiliation":[]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.amc.2015.02.015_b0005","unstructured":"P. Ananth, M. Nasre, New hardness results in rainbow connectivity, arXiv:1104.2074v1 [cs.CC], 2011."},{"key":"10.1016\/j.amc.2015.02.015_b0010","series-title":"Graph Theory, GTM 244","author":"Bondy","year":"2008"},{"key":"10.1016\/j.amc.2015.02.015_b0015","doi-asserted-by":"crossref","first-page":"R57","DOI":"10.37236\/781","article-title":"On rainbow connection","volume":"15","author":"Caro","year":"2008","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.amc.2015.02.015_b0020","doi-asserted-by":"crossref","unstructured":"S. Chakraborty, E. Fischer, A. Matsliah, R. Yuster, Hardness and algorithms for rainbow connectivity, in: 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, 2009, pp. 243\u2013254. Also, see J. Comb. Optim. 21(2011), 330\u2013347.","DOI":"10.1007\/s10878-009-9250-9"},{"key":"10.1016\/j.amc.2015.02.015_b0025","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","article-title":"Rainbow connection in graphs","volume":"133","author":"Chartrand","year":"2008","journal-title":"Math. Bohem."},{"key":"10.1016\/j.amc.2015.02.015_b0030","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.tcs.2013.02.012","article-title":"Further hardness results on the rainbow vertex-connection number of graphs","volume":"481","author":"Chen","year":"2013","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.amc.2015.02.015_b0035","doi-asserted-by":"crossref","first-page":"4531","DOI":"10.1016\/j.tcs.2011.04.032","article-title":"The complexity of determining the rainbow vertex-connection of graphs","volume":"412","author":"Chen","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.amc.2015.02.015_b0040","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-012-1243-2","article-title":"Rainbow connections of graphs: a survey","volume":"29","author":"Li","year":"2013","journal-title":"Graphs Comb."},{"key":"10.1016\/j.amc.2015.02.015_b0045","series-title":"Springer Briefs in Mathematics","article-title":"Rainbow connections of graphs","author":"Li","year":"2012"},{"key":"10.1016\/j.amc.2015.02.015_b0050","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","article-title":"The rainbow connection of a graph is (at most) reciprocal to its minimum degree","volume":"63","author":"Krivelevich","year":"2010","journal-title":"J. Graph Theory"}],"container-title":["Applied Mathematics and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009630031500168X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S009630031500168X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,6,7]],"date-time":"2024-06-07T11:14:16Z","timestamp":1717758856000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S009630031500168X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5]]},"references-count":10,"alternative-id":["S009630031500168X"],"URL":"https:\/\/doi.org\/10.1016\/j.amc.2015.02.015","relation":{},"ISSN":["0096-3003"],"issn-type":[{"value":"0096-3003","type":"print"}],"subject":[],"published":{"date-parts":[[2015,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs","name":"articletitle","label":"Article Title"},{"value":"Applied Mathematics and Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.amc.2015.02.015","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}