{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T20:31:34Z","timestamp":1758054694671,"version":"3.44.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt-Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1016\/j.disc.2022.112829","type":"journal-article","created":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T12:39:09Z","timestamp":1646138349000},"page":"112829","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Upper bounding rainbow connection number by forest number"],"prefix":"10.1016","volume":"345","author":[{"given":"L.","family":"Sunil Chandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5559-7471","authenticated-orcid":false,"given":"Davis","family":"Issac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juho","family":"Lauri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.disc.2022.112829_br0010","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s00373-012-1267-7","article-title":"Rainbow connection number and radius","volume":"30","author":"Basavaraju","year":"2014","journal-title":"Graphs Comb."},{"issue":"1","key":"10.1016\/j.disc.2022.112829_br0020","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."},{"issue":"3","key":"10.1016\/j.disc.2022.112829_br0030","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":"2009","journal-title":"J. Comb. Optim."},{"issue":"2","key":"10.1016\/j.disc.2022.112829_br0040","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"},{"issue":"1","key":"10.1016\/j.disc.2022.112829_br0050","doi-asserted-by":"crossref","DOI":"10.21136\/MB.2008.133947","article-title":"Rainbow connection in graphs","volume":"133","author":"Chartrand","year":"2008","journal-title":"Math. Bohem."},{"year":"2008","series-title":"Chromatic Graph Theory","author":"Chartrand","key":"10.1016\/j.disc.2022.112829_br0060"},{"key":"10.1016\/j.disc.2022.112829_br0070","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.disc.2022.112829_br0080","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."},{"key":"10.1016\/j.disc.2022.112829_br0090","series-title":"Pseudo-Scheduling: A New Approach to the Broadcast Scheduling Problem","first-page":"93","author":"Joseph","year":"2013"},{"issue":"4","key":"10.1016\/j.disc.2022.112829_br0100","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1002\/jgt.22003","article-title":"Some remarks on rainbow connectivity","volume":"83","author":"Kam\u010dev","year":"2016","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.disc.2022.112829_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"},{"year":"2016","series-title":"Chasing the Rainbow Connection: Hardness, Algorithms, and Bounds","author":"Lauri","key":"10.1016\/j.disc.2022.112829_br0120"},{"issue":"1","key":"10.1016\/j.disc.2022.112829_br0130","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":"2012","journal-title":"Graphs Comb."},{"year":"2012","series-title":"Rainbow Connections of Graphs","author":"Li","key":"10.1016\/j.disc.2022.112829_br0140"},{"key":"10.1016\/j.disc.2022.112829_br0150","first-page":"3","article-title":"An updated survey on rainbow connections of graphs-a dynamic survey","volume":"1","author":"Li","year":"2017","journal-title":"Theory Appl. Graphs"},{"issue":"10","key":"10.1016\/j.disc.2022.112829_br0160","doi-asserted-by":"crossref","first-page":"1875","DOI":"10.1016\/j.dam.2007.09.005","article-title":"Facet defining inequalities among graph invariants: the system GraPHedron","volume":"156","author":"M\u00e9lot","year":"2008","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X22000358?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X22000358?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T06:12:11Z","timestamp":1757916731000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X22000358"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7]]},"references-count":16,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["S0012365X22000358"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2022.112829","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[2022,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Upper bounding rainbow connection number by forest number","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2022.112829","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"112829"}}