Burning number of graph products
From MaRDI portal
Publication:1784749
DOI10.1016/J.TCS.2018.06.036zbMATH Open1401.05257OpenAlexW2863831359WikidataQ129598205 ScholiaQ129598205MaRDI QIDQ1784749FDOQ1784749
Authors: D. Mitsche, Paweł Prałat, Elham Roshanbin
Publication date: 27 September 2018
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2018.06.036
Recommendations
Cites Work
Cited In (22)
- Burning number of theta graphs
- Surviving rate of graphs and firefighter problem
- Burning two worlds
- APX-hardness and approximation for the \(k\)-burning number problem
- Bounds on the burning number
- Parameterized Complexity of Graph Burning
- Burning graph classes
- Burning Hamming graphs
- Parameterized complexity of graph burning
- Burning graphs: a probabilistic perspective
- APX-hardness and approximation for the \(k\)-burning number problem
- Improved bounds for burning fence graphs
- Burning numbers of \(t\)-unicyclic graphs
- Burning the plane. Densities of the infinite Cartesian grid
- The generalized burning number of graphs
- Burning number of caterpillars
- Burning Numbers of Barbells
- Burning number of Jahangir graphs
- Graph burning: tight bounds on the burning numbers of path forests and spiders
- Burning numbers of path forests and spiders
- On the burning number of \(p\)-caterpillars
- Burnability of double spiders and path forests
This page was built for publication: Burning number of graph products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1784749)