{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T01:46:28Z","timestamp":1778031988802,"version":"3.51.4"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T00:00:00Z","timestamp":1486339200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002790","name":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100002790","id-type":"DOI","asserted-by":"crossref"}]},{"name":"PROCOPE-DAAD RandConGraph","award":["57134837"],"award-info":[{"award-number":["57134837"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00373-017-1768-5","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T02:51:32Z","timestamp":1486349492000},"page":"449-471","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Burning Graphs: A Probabilistic Perspective"],"prefix":"10.1007","volume":"33","author":[{"given":"Dieter","family":"Mitsche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Pra\u0142at","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elham","family":"Roshanbin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,6]]},"reference":[{"key":"1768_CR1","doi-asserted-by":"crossref","unstructured":"Acan, H., Collevecchio, A., Mehrabian, A., Wormald, N.: On the push and pull protocol for rumour spreading. PODC 2015 (to appear)","DOI":"10.1145\/2767386.2767416"},{"key":"1768_CR2","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1590\/S0103-97332003000300031","volume":"33","author":"J Alder","year":"2003","unstructured":"Alder, J., Lev, E.: Bootstrap percolation: visualizations and applications. Braz. J. Phys. 33, 641\u2013644 (2003)","journal-title":"Braz. J. Phys."},{"key":"1768_CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1137\/070703053","volume":"23","author":"N Alon","year":"2008","unstructured":"Alon, N., Pra\u0142at, P., Wormald, N.: Cleaning regular graphs with brushes. SIAM J. Discrete Math. 23, 233\u2013250 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"1768_CR4","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N Alon","year":"2008","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn. Wiley, New York (2008)","edition":"3"},{"key":"1768_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random Graphs. Cambridge University Press, Cambridge (2001)"},{"key":"1768_CR6","unstructured":"Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E.: Bounds on the Burning Number. Submitted (2016)"},{"key":"1768_CR7","doi-asserted-by":"crossref","unstructured":"Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E.: Burning a Graph is Hard. Submitted (2016)","DOI":"10.1016\/j.dam.2017.07.016"},{"key":"1768_CR8","first-page":"85","volume":"1\u20132","author":"A Bonato","year":"2016","unstructured":"Bonato, A., Janssen, J., Roshanbin, E.: How to burn a graph. Int. Math. 1\u20132, 85\u2013100 (2016)","journal-title":"Int. Math."},{"issue":"3","key":"1768_CR9","doi-asserted-by":"crossref","first-page":"848","DOI":"10.1017\/apr.2016.31","volume":"48","author":"J Diaz","year":"2016","unstructured":"Diaz, J., Mitsche, D., Perarnau, G., Perez-Gimenez, X.: On the relation between graph distance and Euclidean distance in random geometric graphs. Adv. Appl. Probab. 48(3), 848\u2013864 (2016)","journal-title":"Adv. Appl. Probab."},{"key":"1768_CR10","first-page":"57","volume":"43","author":"S Finbow","year":"2009","unstructured":"Finbow, S., MacGillivray, G.: The firefighter problem: a survey of results, directions and questions. Aust. J. Comb. 43, 57\u201377 (2009)","journal-title":"Aust. J. Comb."},{"key":"1768_CR11","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1214\/105051605000000575","volume":"15","author":"A Goel","year":"2005","unstructured":"Goel, A., Rai, S., Krishnamachari, B.: Sharp thresholds for monotone properties in random geometric graphs. Ann. Appl. Probab. 15, 364\u2013370 (2005)","journal-title":"Ann. Appl. Probab."},{"key":"1768_CR12","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032718","volume-title":"Random Graphs","author":"S Janson","year":"2000","unstructured":"Janson, S., \u0141uczak, T., Ruci\u0144ski, A.: Random Graphs. Wiley, New York (2000)"},{"key":"1768_CR13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.tcs.2013.01.032","volume":"481","author":"A Kehagias","year":"2013","unstructured":"Kehagias, A., Mitsche, D., Pra\u0142at, P.: Cops and invisible robbers: the cost of drunkenness. Theor. Comput. Sci. 481, 100\u2013120 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"1768_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.tcs.2012.08.016","volume":"463","author":"A Kehagias","year":"2012","unstructured":"Kehagias, A., Pra\u0142at, P.: Some remarks on cops and drunk robbers. Theor. Comput. Sci. 463, 133\u2013147 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"1768_CR15","unstructured":"Land, M., Lu, L.: An upper bound on burning number of graphs. arXiv:1606.07614"},{"issue":"2","key":"1768_CR16","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1214\/aoap\/1034625335","volume":"7","author":"M Penrose","year":"1997","unstructured":"Penrose, M.: The longest edge of the random minimal spanning tree. Ann. Appl. Probab. 7(2), 340\u2013361 (1997)","journal-title":"Ann. Appl. Probab."},{"key":"1768_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"M Penrose","year":"2003","unstructured":"Penrose, M.: Random Geometric Graphs. Oxford Studies in Probability, Oxford U.P., Oxford (2003)"},{"key":"1768_CR18","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s00373-010-0986-x","volume":"27","author":"P Pra\u0142at","year":"2011","unstructured":"Pra\u0142at, P.: Cleaning random $$d$$ d -regular graphs with Brooms. Gr. Comb. 27, 567\u2013584 (2011)","journal-title":"Gr. Comb."},{"key":"1768_CR19","first-page":"237","volume":"43","author":"P Pra\u0142at","year":"2009","unstructured":"Pra\u0142at, P.: Cleaning random graphs with brushes. Aust. J. Comb. 43, 237\u2013251 (2009)","journal-title":"Aust. J. Comb."},{"issue":"2","key":"1768_CR20","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s00373-012-1265-9","volume":"30","author":"P Pra\u0142at","year":"2014","unstructured":"Pra\u0142at, P.: Graphs with average degree smaller than 30\/11 burn slowly. Gr. Comb. 30(2), 455\u2013470 (2014)","journal-title":"Gr. Comb."},{"issue":"4","key":"1768_CR21","doi-asserted-by":"crossref","first-page":"2157","DOI":"10.1137\/120876113","volume":"27","author":"P Pra\u0142at","year":"2013","unstructured":"Pra\u0142at, P.: Sparse graphs are not flammable. SIAM J. Discrete Math. 27(4), 2157\u20132166 (2013)","journal-title":"SIAM J. Discrete Math."},{"key":"1768_CR22","unstructured":"Roshanbin, E.: Burning a graph as a model of social contagion. PhD Thesis, Dalhousie University (2016)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1768-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1768-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1768-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T05:00:03Z","timestamp":1568782803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1768-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,6]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1768"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1768-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,6]]}}}