{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:58:52Z","timestamp":1725469132394},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_46","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"541-552","source":"Crossref","is-referenced-by-count":3,"title":["Rainbow Connectivity of Sparse Random Graphs"],"prefix":"10.1007","author":[{"given":"Alan","family":"Frieze","sequence":"first","affiliation":[]},{"given":"Charalampos E.","family":"Tsourakakis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","unstructured":"Ananth, P., Nasre, M., Sarpatwar, K.: Rainbow Connectivity: Hardness and Tractability. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 241\u2013251 (2011)"},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press (2001)","DOI":"10.1017\/CBO9780511814068"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Caro, Y., Lev, A., Roditty, Y., Tuza, Z., Yuster, R.: On rainbow connection. Electronic Journal of Combinatorics\u00a015 (2008), http:\/\/www.combinatorics.org\/Volume_15\/PDF\/v15i1r57.pdf","DOI":"10.37236\/781"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Chakrabory, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and Algorithms for Rainbow Connection. Journal of Combinatorial Optimization\u00a021(3) (2011)","DOI":"10.1007\/s10878-009-9250-9"},{"issue":"1","key":"46_CR5","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"133","author":"G. Chartrand","year":"2008","unstructured":"Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: Rainbow connection in graphs. Mathematica Bohemica\u00a0133(1), 85\u201398 (2008), http:\/\/mb.math.cas.cz\/mb133-1\/8.html","journal-title":"Mathematica Bohemica"},{"key":"46_CR6","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P. Erd\u00f6s","year":"1959","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On Random Graphs I. Publicationes Mathematicae\u00a06, 290\u2013297 (1959)","journal-title":"Publicationes Mathematicae"},{"key":"46_CR7","unstructured":"He, J., Liang, H.: On rainbow-k-connectivity of random graphs. Arxiv 1012.1942v1 (2010), http:\/\/arxiv.org\/abs\/1012.1942v1"},{"issue":"2","key":"46_CR8","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/rsa.3240070205","volume":"7","author":"M.R. Jerrum","year":"1995","unstructured":"Jerrum, M.R.: A very simple algorithm for estimating the number of k-colourings of a low-degree graph. Random Structures and Algorithms\u00a07(2), 157\u2013165 (1995)","journal-title":"Random Structures and Algorithms"},{"issue":"3","key":"46_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","volume":"63","author":"M. Krivelevich","year":"2009","unstructured":"Krivelevich, M., Yuster, R.: The rainbow connection of a graph is (at most) reciprocal to its minimum degree. Journal of Graph Theory\u00a063(3), 185\u2013191 (2009)","journal-title":"Journal of Graph Theory"},{"key":"46_CR10","unstructured":"Li, X., Sun, Y.: Rainbow connections of graphs - A survey. Arxiv 1101.5747v2 (2011), http:\/\/arxiv.org\/abs\/1101.5747"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Wormald, N.C.: Models of random regular graphs. In: Surveys in Combinatorics. London Mathematical Society Lecture Note Series, vol.\u00a0276, pp. 239\u2013298 (1999)","DOI":"10.1017\/CBO9780511721335.010"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T09:34:09Z","timestamp":1714210449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}