Graph burning: tight bounds on the burning numbers of path forests and spiders
type: Item
instance of: scholarly article
title: Graph burning: tight bounds on the burning numbers of path forests and spiders
author: Ta Sheng Tan
author: Wen Chean Teh
published in: Applied Mathematics and Computation
publication date: 2021-03-12T00:00:00Z
full work available at URL: https://arxiv.org/abs/1910.04399
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 7321672
zbMATH Keywords: burning number conjecture
zbMATH Keywords: graph algorithm
zbMATH Keywords: spider
zbMATH Keywords: path forest
MaRDI profile type: Publication
OpenAlex ID: W3036097035
cites work: Burning a graph is hard
cites work: Bounds on the burning number
cites work: How to Burn a Graph
cites work: Approximation algorithms for graph burning
cites work: Bounds on the burning numbers of spiders and path-forests
cites work: Burning spiders
cites work: An upper bound on the burning number of graphs
cites work: Burning graphs: a probabilistic perspective
cites work: Burning number of graph products
cites work: On the burning number of generalized Petersen graphs
DOI: 10.1016/J.AMC.2020.125447
description: scientific article; zbMATH DE number 7321672