{"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":1772952681535,"version":"3.50.1"},"reference-count":23,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,7,1]],"date-time":"2018-07-01T00:00:00Z","timestamp":1530403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,7,10]],"date-time":"2022-07-10T00:00:00Z","timestamp":1657411200000},"content-version":"vor","delay-in-days":1470,"URL":"https:\/\/2.zoppoz.workers.dev:443\/http\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1016\/j.dam.2018.01.014","type":"journal-article","created":{"date-parts":[[2018,3,24]],"date-time":"2018-03-24T00:27:50Z","timestamp":1521851270000},"page":"248-261","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Rainbow connections in digraphs"],"prefix":"10.1016","volume":"243","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-7774-0512","authenticated-orcid":false,"given":"El\u017cbieta","family":"Sidorowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-9570-1840","authenticated-orcid":false,"given":"\u00c9ric","family":"Sopena","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2018.01.014_b1","unstructured":"J. Alva-Samos, J.J. Montellano-Ballesteros, A Note on the Rainbow Connectivity of Tournaments. Preprint (2015), available at https:\/\/2.zoppoz.workers.dev:443\/http\/arxiv.org\/abs\/1504.07140."},{"issue":"6","key":"10.1016\/j.dam.2018.01.014_b2","doi-asserted-by":"crossref","first-page":"2199","DOI":"10.1007\/s00373-016-1723-x","article-title":"Rainbow connection in some digraphs","volume":"32","author":"Alva-Samos","year":"2016","journal-title":"Graphs Combin."},{"key":"10.1016\/j.dam.2018.01.014_b3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.7151\/dmgt.1953","article-title":"Rainbow connectivity of cacti and of some infinity digraphs","volume":"37","author":"Alva-Samos","year":"2017","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2018.01.014_b4","unstructured":"P. Ananth, M. Nasre, K.K. Sarpatwar, Rainbow connectivity: Hardness and tractability, in: 31st Int\u2019l Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, Leibniz International Proceedings in Informatics, pp. 241\u2013251."},{"key":"10.1016\/j.dam.2018.01.014_b5","series-title":"Graph Theory","volume":"vol. 244","author":"Bondy","year":"2011"},{"key":"10.1016\/j.dam.2018.01.014_b6","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. Combin."},{"key":"10.1016\/j.dam.2018.01.014_b7","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/s10878-009-9250-9","article-title":"Hardness and algorithms for rainbow connectivity","volume":"21","author":"Chakraborty","year":"2011","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2018.01.014_b8","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.dam.2018.01.014_b9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.7151\/dmgt.1856","article-title":"Hardness results for total rainbow connection of graphs","volume":"36","author":"Chen","year":"2016","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.dam.2018.01.014_b10","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":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2018.01.014_b11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.dam.2014.07.018","article-title":"Rainbow connection in oriented graphs","volume":"179","author":"Dorbec","year":"2014","journal-title":"Discrete Appl. Math."},{"issue":"19","key":"10.1016\/j.dam.2018.01.014_b12","doi-asserted-by":"crossref","first-page":"1884","DOI":"10.1016\/j.disc.2012.04.022","article-title":"The rainbow connection number of 2-connected graphs","volume":"313","author":"Ekstein","year":"2013","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.dam.2018.01.014_b13","doi-asserted-by":"crossref","first-page":"313","DOI":"10.7151\/dmgt.1547","article-title":"Graphs with rainbow connection number two","volume":"31","author":"Kemnitz","year":"2011","journal-title":"Discuss. Math. Graph Theory"},{"issue":"3","key":"10.1016\/j.dam.2018.01.014_b14","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":"2009","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2018.01.014_b15","unstructured":"V.B. Le, Zs. Tuza, Finding optimal rainbow connection is hard. Technical Report CS-03-09, Universit\u00e4t Rostock, 2009."},{"key":"10.1016\/j.dam.2018.01.014_b16","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s10878-017-0156-7","article-title":"Rainbow vertex connection of digraphs","volume":"35","author":"Lei","year":"2018","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.dam.2018.01.014_b17","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.dam.2017.10.016","article-title":"Total rainbow connection of digraphs","volume":"236","author":"Lei","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2018.01.014_b18","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 Combin."},{"key":"10.1016\/j.dam.2018.01.014_b19","series-title":"Rainbow Connections of Graphs","author":"Li","year":"2012"},{"key":"10.1016\/j.dam.2018.01.014_b20","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.dam.2014.04.012","article-title":"Total rainbow k-connection in graphs","volume":"174","author":"Liu","year":"2014","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2018.01.014_b21","series-title":"Rainbow Connection in Graphs with Minimum Degree Three","first-page":"432","volume":"vol. 5874","author":"Schiermeyer","year":"2009"},{"issue":"12","key":"10.1016\/j.dam.2018.01.014_b22","doi-asserted-by":"crossref","first-page":"1784","DOI":"10.1016\/j.dam.2011.10.009","article-title":"Rainbow connection and minimum degree","volume":"161","author":"Schiermeyer","year":"2013","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2018.01.014_b23","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.dam.2017.12.017","article-title":"Strong rainbow connection in digraphs","volume":"238","author":"Sidorowicz","year":"2018","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X18300775?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0166218X18300775?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T08:11:14Z","timestamp":1719907874000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X18300775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":23,"alternative-id":["S0166218X18300775"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2018.01.014","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2018,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Rainbow connections in digraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.dam.2018.01.014","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}