The firefighter problem for graphs of maximum degree three

69Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

Abstract

We show that the firefighter problem is NP-complete for trees of maximum degree three, but in P for graphs of maximum degree three if the fire breaks out at a vertex of degree at most two. © 2006 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Finbow, S., King, A., MacGillivray, G., & Rizzi, R. (2007). The firefighter problem for graphs of maximum degree three. Discrete Mathematics, 307(16), 2094–2105. https://doi.org/10.1016/j.disc.2005.12.053

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free