{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:35:57Z","timestamp":1720200957503},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T00:00:00Z","timestamp":1412121600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,10,23]],"date-time":"2018-10-23T00:00:00Z","timestamp":1540252800000},"content-version":"vor","delay-in-days":1483,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"name":"JSPS KAKENHI","award":["25330005","25330003","23500001"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1016\/j.tcs.2014.01.007","type":"journal-article","created":{"date-parts":[[2014,1,11]],"date-time":"2014-01-11T02:46:03Z","timestamp":1389408363000},"page":"35-42","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Generalized rainbow connectivity of graphs"],"prefix":"10.1016","volume":"555","author":[{"given":"Kei","family":"Uchizawa","sequence":"first","affiliation":[]},{"given":"Takanori","family":"Aoki","sequence":"additional","affiliation":[]},{"given":"Takehiro","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2014.01.007_br0010","doi-asserted-by":"crossref","first-page":"844","DOI":"10.1145\/210332.210337","article-title":"Color-coding","volume":"42","author":"Alon","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/j.tcs.2014.01.007_br0020","series-title":"Proc. of 31st Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011)","first-page":"241","article-title":"Rainbow connectivity: hardness and tractability","author":"Ananth","year":"2011"},{"key":"10.1016\/j.tcs.2014.01.007_br0030","series-title":"Graph Classes: A Survey","author":"Brandst\u00e4dt","year":"1999"},{"key":"10.1016\/j.tcs.2014.01.007_br0040","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/s10878-009-9250-9","article-title":"Hardness and algorithms for rainbow connection","volume":"21","author":"Chakraborty","year":"2011","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.tcs.2014.01.007_br0050","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1002\/jgt.20643","article-title":"Rainbow connection number and connected dominating sets","volume":"71","author":"Chandran","year":"2012","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.tcs.2014.01.007_br0060","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.tcs.2014.01.007_br0070","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1002\/net.20296","article-title":"The rainbow connectivity of a graph","volume":"54","author":"Chartrand","year":"2009","journal-title":"Networks"},{"key":"10.1016\/j.tcs.2014.01.007_br0080","doi-asserted-by":"crossref","first-page":"R57","DOI":"10.37236\/781","article-title":"On rainbow connectivity","volume":"15","author":"Caro","year":"2008","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.tcs.2014.01.007_br0090","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.jcss.2010.02.012","article-title":"The parameterized complexity of some minimum label problems","volume":"76","author":"Fellows","year":"2010","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.tcs.2014.01.007_br0100","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.tcs.2014.01.007_br0110","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"},{"key":"10.1016\/j.tcs.2014.01.007_br0120","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00453-012-9689-4","article-title":"On the rainbow connectivity of graphs: complexity and FPT algorithms","volume":"67","author":"Uchizawa","year":"2013","journal-title":"Algorithmica"},{"key":"10.1016\/j.tcs.2014.01.007_br0130","series-title":"Proc. of 7th International Workshop on Algorithms and Computation (WALCOM 2013)","first-page":"233","article-title":"Generalized rainbow connectivity of graphs","volume":"vol. 7748","author":"Uchizawa","year":"2013"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514000243?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397514000243?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:46:29Z","timestamp":1716425189000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397514000243"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10]]},"references-count":13,"alternative-id":["S0304397514000243"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2014.01.007","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2014,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized rainbow connectivity of graphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2014.01.007","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}