{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T04:17:59Z","timestamp":1740111479028,"version":"3.37.3"},"reference-count":12,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,3,28]],"date-time":"2017-03-28T00:00:00Z","timestamp":1490659200000},"content-version":"vor","delay-in-days":1488,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11071130"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2013,3]]},"DOI":"10.1016\/j.disc.2012.12.014","type":"journal-article","created":{"date-parts":[[2013,1,16]],"date-time":"2013-01-16T08:31:52Z","timestamp":1358325112000},"page":"755-759","source":"Crossref","is-referenced-by-count":6,"title":["A sharp upper bound for the rainbow 2-connection number of a 2-connected graph"],"prefix":"10.1016","volume":"313","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[]},{"given":"Sujuan","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1978","series-title":"Extremal Graph Theory","author":"Bollob\u00e1s","key":"10.1016\/j.disc.2012.12.014_br000005"},{"key":"10.1016\/j.disc.2012.12.014_br000010","series-title":"Graph Theory","volume":"vol. 244","author":"Bondy","year":"2008"},{"issue":"1","key":"10.1016\/j.disc.2012.12.014_br000015","doi-asserted-by":"crossref","DOI":"10.37236\/781","article-title":"On rainbow connection","volume":"15","author":"Caro","year":"2008","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.disc.2012.12.014_br000020","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":"2010","journal-title":"J. Comb. Optim."},{"key":"10.1016\/j.disc.2012.12.014_br000025","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.endm.2011.09.040","article-title":"Rainbow connection nuumber and connected dominating sets","volume":"38","author":"Chandran","year":"2011","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.disc.2012.12.014_br000030","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.disc.2012.12.014_br000035","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.disc.2012.12.014_br000040","unstructured":"S. Fujita, H. Liu, C. Magnant, Rainbow k-connection in dense graphs, Preprint. Availabel at www.cantab.net\/users\/henry.liu\/maths.htm."},{"key":"10.1016\/j.disc.2012.12.014_br000045","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/j.endm.2011.09.059","article-title":"Rainbow k-connection in dense graphs (Extended Abstract)","volume":"38","author":"Fujita","year":"2011","journal-title":"Electron. Notes Discrete Math."},{"key":"10.1016\/j.disc.2012.12.014_br000050","doi-asserted-by":"crossref","DOI":"10.37236\/1172","article-title":"Rainbow connection number and connectivity","volume":"19","author":"Li","year":"2012","journal-title":"Electron. J. Combin."},{"year":"2012","series-title":"Rainbow Connections of Graphs","author":"Li","key":"10.1016\/j.disc.2012.12.014_br000055"},{"issue":"1","key":"10.1016\/j.disc.2012.12.014_br000060","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."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X12005365?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X12005365?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,4,3]],"date-time":"2021-04-03T10:06:16Z","timestamp":1617444376000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X12005365"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["S0012365X12005365"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2012.12.014","relation":{},"ISSN":["0012-365X"],"issn-type":[{"type":"print","value":"0012-365X"}],"subject":[],"published":{"date-parts":[[2013,3]]}}}