{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:18:48Z","timestamp":1781259528894,"version":"3.54.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"16","license":[{"start":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T00:00:00Z","timestamp":1183248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":2208,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1016\/j.disc.2005.12.053","type":"journal-article","created":{"date-parts":[[2006,12,7]],"date-time":"2006-12-07T18:01:58Z","timestamp":1165514518000},"page":"2094-2105","source":"Crossref","is-referenced-by-count":90,"title":["The firefighter problem for graphs of maximum degree three"],"prefix":"10.1016","volume":"307","author":[{"given":"Stephen","family":"Finbow","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrew","family":"King","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gary","family":"MacGillivray","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2005.12.053_bib1","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1002\/net.3230190704","article-title":"On designing a network to defend against random attacks on radius two","volume":"19","author":"Finbow","year":"1989","journal-title":"Networks"},{"key":"10.1016\/j.disc.2005.12.053_bib2","first-page":"311","article-title":"On minimizing the effects of fire or a virus on a network","volume":"33","author":"Finbow","year":"2000","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.disc.2005.12.053_bib3","unstructured":"P. Fogarty, Catching the fire on grids, M.Sc. Thesis, Department of Mathematics, University of Vermont, USA, 2003."},{"key":"10.1016\/j.disc.2005.12.053_bib4","series-title":"Computer and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/j.disc.2005.12.053_bib5","first-page":"69","article-title":"Graphs with isomorphic survivor graphs","volume":"79","author":"Gunther","year":"1990","journal-title":"Congr. Numer."},{"key":"10.1016\/j.disc.2005.12.053_bib6","unstructured":"A. Yousef, C. Gary, O.R. Oellermann, A.J. Schwenk (Eds.), Graph theory, combinatorics, and applications, vol. 2, Proceedings of the sixth quadrennial international conference on the theory and applications of graphs held at Western Michigan University, Kalamazoo, MI, USA, May 30\u2013June 3, 1988, Wiley, New York, 1991, ISBN: 0-471-53219-3."},{"key":"10.1016\/j.disc.2005.12.053_bib7","unstructured":"B.L. Hartnell, Firefighter! An application of domination. Presentation, 24th Manitoba Conference on Combinatorial Mathematics and Computing, University of Manitoba in Winnipeg, Canada, 1995."},{"key":"10.1016\/j.disc.2005.12.053_bib8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(91)90271-3","article-title":"On minimal neighbourhood-connected graphs","volume":"92","author":"Hartnell","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2005.12.053_bib9","unstructured":"B. Hartnell, Q. Li, Firefighting on trees: how bad is the greedy algorithm? Proceedings of the Thirty-first Southeastern International Conference on Combinatorics, Graph Theory and Computing, Boca Raton, FL, 2000, Congr. Numer. 145 (2000) 187\u2013192."},{"key":"10.1016\/j.disc.2005.12.053_bib10","first-page":"83","article-title":"On the firefighter problem","volume":"47","author":"MacGillivray","year":"2003","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/j.disc.2005.12.053_bib11","first-page":"19","article-title":"Fire control on graphs","volume":"41","author":"Moeller","year":"2002","journal-title":"J. Combin. Math. Combin. Comput."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0012365X0600776X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0012365X0600776X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,11]],"date-time":"2019-01-11T00:59:57Z","timestamp":1547168397000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X0600776X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7]]},"references-count":11,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["S0012365X0600776X"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.disc.2005.12.053","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2007,7]]}}}