The burning number of directed graphs: Bounds and computational complexity

Remie Janssen*

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)
34 Downloads (Pure)


The burning number of a graph was recently introduced by Bonato et al. Although they mention that the burning number generalises naturally to directed graphs, no further research on this has been done. Here, we introduce graph burning for directed graphs, and we study bounds for the corresponding burning number and the hardness of finding this number. We derive sharp bounds from simple algorithms and examples. The hardness question yields more surprising results: finding the burning number of a directed tree with one indegree-0 node is NP-hard, but FPT; however, it is W[2]complete for DAGs. Finally, we give a fixed-parameter algorithm to find the burning number of a digraph, with a parameter inspired by research in phylogenetic networks.

Original languageEnglish
Article number8
Number of pages14
JournalTheory and Applications of Graphs
Issue number1
Publication statusPublished - 2020


Dive into the research topics of 'The burning number of directed graphs: Bounds and computational complexity'. Together they form a unique fingerprint.

Cite this