{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T10:52:23Z","timestamp":1762253543509,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T00:00:00Z","timestamp":1601251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T00:00:00Z","timestamp":1601251200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s00373-020-02234-0","type":"journal-article","created":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T18:02:27Z","timestamp":1601316147000},"page":"167-181","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Rainbow Antistrong Connection in Tournaments"],"prefix":"10.1007","volume":"37","author":[{"given":"Yumei","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4004-4289","authenticated-orcid":false,"given":"Yarong","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,28]]},"reference":[{"key":"2234_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, J.J.: Rainbow connection in some digraphs. Graphs Comb. 32, 2199\u20132209 (2016)","journal-title":"Graphs Comb."},{"key":"2234_CR2","doi-asserted-by":"crossref","first-page":"301","DOI":"10.7151\/dmgt.1953","volume":"37","author":"J Alva-Samos","year":"2017","unstructured":"Alva-Samos, J., Montellano-Ballesteros, J.J.: Rainbow connectivity of cacti and of some infinite digraphs. Discuss. Math. Graph Theory 37, 301\u2013313 (2017)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2234_CR3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.jctb.2016.05.004","volume":"122","author":"J Bang-Jensen","year":"2017","unstructured":"Bang-Jensen, J., Bessy, S., Jackson, B., Kriesell, M.: Antistrong digraphs. J. Comb. Theory Ser. B 122, 68\u201390 (2017)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2234_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84800-998-1","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"J Bang-Jensen","year":"2009","unstructured":"Bang-Jensen, J., Gutin, G.: Digraphs: Theory, Algorithms and Applications, 2nd edn. Spinger, London (2009)","edition":"2"},{"key":"2234_CR5","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory, GTM, vol. 244. Springer (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"key":"2234_CR6","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1007\/s10878-009-9250-9","volume":"21","author":"S Chakraborty","year":"2011","unstructured":"Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and algorithms for rainbow connectivity. J. Comb. Optim. 21, 330\u2013347 (2011)","journal-title":"J. Comb. Optim."},{"key":"2234_CR7","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"13","author":"G Chartrand","year":"2008","unstructured":"Chartrand, G., Johns, G.L., McKeonet, K.A., Zhang, P.: Rainbow connection in graphs. Math. Bohem. 13, 85\u201398 (2008)","journal-title":"Math. Bohem."},{"key":"2234_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., Sidorowica, E., Sopena, \u00c9.: Rainbow connection in oriented graphs. Discrete Appl. Math. 179, 69\u201378 (2014)","journal-title":"Discrete Appl. Math."},{"key":"2234_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.: The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory 63, 185\u2013191 (2010)","journal-title":"J. Graph Theory"},{"key":"2234_CR10","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s10878-017-0156-7","volume":"35","author":"H Lei","year":"2018","unstructured":"Lei, H., Li, S., Liu, H., Shi, Y.: Rainbow vertex connection of digraphs. J. Comb. Optim. 35, 86\u2013107 (2018)","journal-title":"J. Comb. Optim."},{"key":"2234_CR11","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.: Rainbow connections of graphs: a survey. Graphs Comb. 29, 1\u201338 (2013)","journal-title":"Graphs Comb."},{"key":"2234_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3119-0","volume-title":"Rainbow Connections of Graphs. Springers Briefs in Mathematics","author":"X Li","year":"2012","unstructured":"Li, X., Sun, Y.: Rainbow Connections of Graphs. Springers Briefs in Mathematics. Springer, New York (2012)"},{"key":"2234_CR13","volume-title":"Topics on Tournaments","author":"JW Moon","year":"1968","unstructured":"Moon, J.W.: Topics on Tournaments. Holt, Rinehart and Winston, New York (1968)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02234-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02234-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02234-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T00:46:07Z","timestamp":1723682767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02234-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,28]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["2234"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02234-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,9,28]]},"assertion":[{"value":"23 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}