{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T09:02:41Z","timestamp":1780909361054,"version":"3.54.1"},"reference-count":31,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T00:00:00Z","timestamp":1777507200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","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":[[2026,10]]},"DOI":"10.1016\/j.disc.2026.115198","type":"journal-article","created":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T12:54:41Z","timestamp":1777985681000},"page":"115198","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Between burning and cooling: liminal burning on graphs"],"prefix":"10.1016","volume":"349","author":[{"given":"Anthony","family":"Bonato","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Trent G.","family":"Marbach","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"John","family":"Marcoux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Teddy","family":"Mishura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115198_br0010","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0166-218X(92)90121-P","article-title":"Transmitting in the n-dimensional cube","volume":"37","author":"Alon","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115198_br0020","series-title":"Computational Complexity: A Modern Approach","author":"Arora","year":"2009"},{"key":"10.1016\/j.disc.2026.115198_br0030","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.dam.2017.07.016","article-title":"Burning a graph is hard","volume":"232","author":"Bessy","year":"2017","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115198_br0040","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.dam.2017.09.012","article-title":"Bounds on the burning number","volume":"235","author":"Bessy","year":"2018","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115198_br0050","doi-asserted-by":"crossref","first-page":"185","DOI":"10.55016\/ojs\/cdm.v16i1.71194","article-title":"A survey of graph burning","volume":"16","author":"Bonato","year":"2021","journal-title":"Contrib. Discrete Math."},{"key":"10.1016\/j.disc.2026.115198_br0060","series-title":"An Invitation to Pursuit-Evasion Games and Graph Theory","author":"Bonato","year":"2022"},{"key":"10.1016\/j.disc.2026.115198_br0070","doi-asserted-by":"crossref","first-page":"2761","DOI":"10.1007\/s00373-021-02390-x","article-title":"Improved bounds for burning fence graphs","volume":"37","author":"Bonato","year":"2021","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115198_br0080","doi-asserted-by":"crossref","first-page":"1311","DOI":"10.1007\/s00373-020-02182-9","article-title":"Burning the plane: densities of the infinite Cartesian grid","volume":"36","author":"Bonato","year":"2020","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115198_br0090","series-title":"Proceedings of the 11th Workshop on Algorithms and Models for the Web Graph (WAW)","article-title":"Burning a graph as a model of social contagion","author":"Bonato","year":"2014"},{"key":"10.1016\/j.disc.2026.115198_br0100","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1080\/15427951.2015.1103339","article-title":"How to burn a graph","volume":"1\u20132","author":"Bonato","year":"2016","journal-title":"Internet Math."},{"key":"10.1016\/j.disc.2026.115198_br0110","series-title":"Proceedings of the Annual Conference on Theory and Applications of Models of Computation (TAMC)","article-title":"Approximation algorithms for graph burning","author":"Bonato","year":"2019"},{"key":"10.1016\/j.disc.2026.115198_br0120","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1016\/j.tcs.2018.05.035","article-title":"Bounds on the burning numbers of spiders and path-forests","volume":"794","author":"Bonato","year":"2019","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.disc.2026.115198_br0130","series-title":"Proceedings of the 19th Workshop on Algorithms and Models for the Web Graph (WAW)","article-title":"How to cool a graph","author":"Bonato","year":"2024"},{"key":"10.1016\/j.disc.2026.115198_br0140","unstructured":"N. Chiarelli, V. Ir\u0161i\u010d, M. Jakovac, W.B. Kinnersley, M. Mikala\u010dki, Burning game, Preprint, 2025."},{"key":"10.1016\/j.disc.2026.115198_br0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114253","article-title":"Adversarial graph burning densities","volume":"348","author":"Gunderson","year":"2025","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115198_br0160","article-title":"The burning number of directed graphs: bounds and computational complexity","volume":"7","author":"Janssen","year":"2020","journal-title":"Theory Appl. Graphs"},{"key":"10.1016\/j.disc.2026.115198_br0170","unstructured":"S. Kamali, On the cooling problem, Preprint, 2025."},{"key":"10.1016\/j.disc.2026.115198_br0180","series-title":"Proceedings of the International Conference on Current Trends in Theory and Practice of Informatics (SOFSEM)","article-title":"Burning two worlds: algorithms for burning dense and tree-Like graphs","author":"Kamali","year":"2020"},{"key":"10.1016\/j.disc.2026.115198_br0190","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.disc.2026.115198_br0200","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0021-9800(66)80027-3","article-title":"On a combinatorial conjecture of Erd\u0151s","volume":"1","author":"Kleitman","year":"1966","journal-title":"J. Comb. Theory"},{"key":"10.1016\/j.disc.2026.115198_br0210","series-title":"Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC)","article-title":"Parameterized complexity of graph burning","author":"Kobayashi","year":"2020"},{"key":"10.1016\/j.disc.2026.115198_br0220","series-title":"Proceedings of the 13th Workshop on Algorithms and Models for the Web Graph (WAW)","article-title":"An upper bound on burning number of graphs","author":"Land","year":"2016"},{"key":"10.1016\/j.disc.2026.115198_br0230","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1145\/322186.322201","article-title":"GO is polynomial-space hard","volume":"27","author":"Lichtenstein","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/j.disc.2026.115198_br0240","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.dam.2020.03.062","article-title":"Burning number of caterpillars","volume":"284","author":"Liu","year":"2020","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115198_br0250","series-title":"Cooling a graph as a model of actual contagion","author":"Milne","year":"2024"},{"key":"10.1016\/j.disc.2026.115198_br0260","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/s00373-017-1768-5","article-title":"Burning graphs: a probabilistic perspective","volume":"33","author":"Mitsche","year":"2017","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115198_br0270","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.tcs.2018.06.036","article-title":"Burning number of graph products","volume":"746","author":"Mitsche","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.disc.2026.115198_br0280","unstructured":"D. Mondal, N. Parthiabn, V. Kavitha, I. Rajasingh, APX-hardness and approximation for the k-burning number problem, Preprint, 2025."},{"key":"10.1016\/j.disc.2026.115198_br0290","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","article-title":"On the complexity of some two-person perfect-information games","volume":"16","author":"Schaefer","year":"1978","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.disc.2026.115198_br0300","series-title":"Proceedings of the Fifth Annual ACM Symposium on Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"},{"key":"10.1016\/j.disc.2026.115198_br0310","series-title":"Introduction to Graph Theory","author":"West","year":"2001"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002220?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26002220?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T08:18:43Z","timestamp":1780906723000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26002220"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":31,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2026,10]]}},"alternative-id":["S0012365X26002220"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115198","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Between burning and cooling: liminal burning on graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115198","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115198"}}