Burning and \(w\)-burning of geometric graphs

DOI10.1016/j.dam.2023.03.026zbMath1515.05171OpenAlexW4366156359MaRDI QIDQ6103478

Barun Gorain, Kaushik Mondal, Arya Tanmay Gupta, Supantha Pandit, Swapnil A. Lokhande

Publication date: 5 June 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.03.026

zbMATH Keywords

gridsNP-completenessinterval graphspermutation graphsspider graphs\(w\)-burning problemburning problem

Mathematics Subject Classification ID

Trees (05C05) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Burning grids and intervals
• Bounds on the burning number
• On the burning number of \(p\)-caterpillars
• Parameterized algorithms for Graph Burning problem
• Approximation algorithms for graph burning
• Bounds on the burning numbers of spiders and path-forests
• Burning a graph is hard
• Burning spiders
• Burning a Graph as a Model of Social Contagion
• Graph bootstrap percolation
• Burning Two Worlds
• Cleaning Regular Graphs with Brushes
• Automata, Languages and Programming
• How to Burn a Graph
• APX-hardness and approximation for the \(k\)-burning number problem

This page was built for publication: Burning and \(w\)-burning of geometric graphs