The Burning Number of Directed Graphs: Bounds and Computational Complexity

DOI10.20429/tag.2020.070108zbMath1447.05090arXiv2001.03381OpenAlexW3033022097MaRDI QIDQ5119806

Remie Janssen

Publication date: 1 September 2020

Published in: Theory and Applications of Graphs (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2001.03381

zbMATH Keywords

graph burningburning sequencesource of fire

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

A survey of graph burning ⋮ Parameterized complexity of graph burning ⋮ Burn and win ⋮ Parameterized Complexity of Graph Burning ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Burning numbers of \(t\)-unicyclic graphs

This page was built for publication: The Burning Number of Directed Graphs: Bounds and Computational Complexity