September 01, 2017 article Open access Burning a graph is hard Discrete Applied Mathematics DOI: 10.1016/j.dam.2017.07.016 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 3 stored of 74 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Upper bounds and approximation results for the k -slow burning problem 2024 Discrete Applied Mathematics article Computer Science Advanced Graph Theory Research Open access 1 citations k-Slow Burning: Complexity and Upper Bounds 2024 AIRO Springer series/AIRO Springer Series conference-paper Computer Science Advanced Graph Theory Research 0 citations On the Burning Number of p-Caterpillars 2020 AIRO Springer series/AIRO Springer Series book-chapter Computer Science Advanced Graph Theory Research 21 citations 3 results References 0