{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T06:51:21Z","timestamp":1772952681542,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T00:00:00Z","timestamp":1500249600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin City","doi-asserted-by":"publisher","award":["17JCQNJC00300"],"award-info":[{"award-number":["17JCQNJC00300"]}],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11301480"],"award-info":[{"award-number":["11301480"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007834","name":"Natural Science Foundation of Ningbo","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007834","id-type":"DOI","asserted-by":"publisher"}]},{"name":"International Interchange Plan of Central South University"},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2015M580695"],"award-info":[{"award-number":["2015M580695"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2016T90756"],"award-info":[{"award-number":["2016T90756"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10878-017-0156-7","type":"journal-article","created":{"date-parts":[[2017,7,17]],"date-time":"2017-07-17T14:20:18Z","timestamp":1500301218000},"page":"86-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Rainbow vertex connection of digraphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Hui","family":"Lei","sequence":"first","affiliation":[]},{"given":"Shasha","family":"Li","sequence":"additional","affiliation":[]},{"given":"Henry","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,17]]},"reference":[{"key":"156_CR1","doi-asserted-by":"crossref","first-page":"2199","DOI":"10.1007\/s00373-016-1723-x","volume":"32","author":"J Alva-Samos","year":"2016","unstructured":"Alva-Samos J, Montellano-Ballesteros JJ (2016) Rainbow connection in some digraphs. Graphs Comb 32:2199\u20132209","journal-title":"Graphs Comb"},{"key":"156_CR2","unstructured":"Alva-Samos J, Montellano-Ballesteros JJ (2015) A note on the rainbow connectivity of tournaments. ArXiv preprint arXiv:1504.07140"},{"key":"156_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern graph theory","author":"B Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s B (1998) Modern graph theory. Springer, New York"},{"key":"156_CR4","doi-asserted-by":"crossref","unstructured":"Caro Y, Lev A, Roditty Y, Tuza Zs, Yuster R (2008) On rainbow connection. Electron J Comb 15:R57","DOI":"10.37236\/781"},{"key":"156_CR5","doi-asserted-by":"crossref","unstructured":"Chakraborty S, Fischer E, Matsliah A, Yuster R (2011) Hardness and algorithms for rainbow connectivity. In: 26th international symposium on theoretical aspects of computer science STACS 2009 (2009), pp 243\u2013254. See also J Comb Optim 21:330\u2013347","DOI":"10.1007\/s10878-009-9250-9"},{"key":"156_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"133","author":"G Chartrand","year":"2008","unstructured":"Chartrand G, Johns GL, McKeon KA, Zhang P (2008) Rainbow connection in graphs. Math Bohem 133:85\u201398","journal-title":"Math Bohem"},{"key":"156_CR7","doi-asserted-by":"crossref","first-page":"4531","DOI":"10.1016\/j.tcs.2011.04.032","volume":"412","author":"L Chen","year":"2011","unstructured":"Chen L, Li X, Shi Y (2011) The complexity of determining the rainbow vertex-connection of a graph. Theor Comput Sci 412:4531\u20134535","journal-title":"Theor Comput Sci"},{"key":"156_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.dam.2014.07.018","volume":"179","author":"P Dorbec","year":"2014","unstructured":"Dorbec P, Schiermeyer I, Sidorowicz E, Sopena E (2014) Rainbow connection in oriented graphs. Discrete Appl Math 179:69\u201378","journal-title":"Discrete Appl Math"},{"key":"156_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","volume":"63","author":"M Krivelevich","year":"2010","unstructured":"Krivelevich M, Yuster R (2010) The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J Graph Theory 63:185\u2013191","journal-title":"J Graph Theory"},{"key":"156_CR10","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/j.dam.2014.04.002","volume":"173","author":"X Li","year":"2014","unstructured":"Li X, Liu S (2014) Tight upper bound of the rainbow vertex-connection number for 2-connected graphs. Discrete Appl Math 173:62\u201369","journal-title":"Discrete Appl Math"},{"key":"156_CR11","first-page":"213","volume":"93","author":"X Li","year":"2014","unstructured":"Li X, Mao Y, Shi Y (2014) The strong rainbow vertex-connection of graphs. Util Math 93:213\u2013223","journal-title":"Util Math"},{"key":"156_CR12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.7151\/dmgt.1664","volume":"33","author":"X Li","year":"2013","unstructured":"Li X, Shi Y (2013) On the rainbow vertex-connection. Discuss Math Graph Theory 33:307\u2013313","journal-title":"Discuss Math Graph Theory"},{"key":"156_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-012-1243-2","volume":"29","author":"X Li","year":"2013","unstructured":"Li X, Shi Y, Sun Y (2013) Rainbow connections of graphs: a survey. Graphs Comb 29:1\u201338","journal-title":"Graphs Comb"},{"key":"156_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3119-0","volume-title":"Rainbow connections of graphs. Springer briefs in mathematics","author":"X Li","year":"2012","unstructured":"Li X, Sun Y (2012) Rainbow connections of graphs. Springer briefs in mathematics. Springer, New York"},{"key":"156_CR15","doi-asserted-by":"crossref","first-page":"2549","DOI":"10.1016\/j.dam.2013.04.025","volume":"161","author":"H Liu","year":"2013","unstructured":"Liu H, Mestre \u00c2, Sousa T (2013) Rainbow vertex $$k$$ k -connection in graphs. Discrete Appl Math 161:2549\u20132555","journal-title":"Discrete Appl Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-017-0156-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0156-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-017-0156-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T15:12:17Z","timestamp":1719328337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-017-0156-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,17]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["156"],"URL":"https:\/\/doi.org\/10.1007\/s10878-017-0156-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,17]]}}}