On the burning number of \(p\)-caterpillars

DOI10.1007/978-3-030-63072-0_12zbMath1479.05339arXiv1912.10897OpenAlexW2996203613MaRDI QIDQ2056898

Arie M. C. A. Koster, Michaela Hiller, Eberhard Triesch

Publication date: 8 December 2021

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

zbMATH Keywords

computational complexitycaterpillar graphsburning number

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (7)

Parameterized complexity of graph burning ⋮ Burning and \(w\)-burning of geometric graphs ⋮ Burn and win ⋮ Improved pyrotechnics: closer to the burning number conjecture ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Burning numbers of \(t\)-unicyclic graphs ⋮ Burnability of double spiders and path forests

Cites Work

• Multigraph realizations of degree sequences: Maximization is easy, minimization is hard
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph is hard
• The number of caterpillars
• How to Burn a Graph

This page was built for publication: On the burning number of \(p\)-caterpillars