Burning grids and intervals

DOI10.1007/978-3-030-67899-9_6OpenAlexW3011063025MaRDI QIDQ831694

Arya Tanmay Gupta, Swapnil A. Lokhande, Kaushik Mondal

Publication date: 24 March 2022

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the burning number
• 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
• Epidemic Spreading With External Agents
• Graph bootstrap percolation
• Burning Two Worlds
• Cleaning Regular Graphs with Brushes
• Automata, Languages and Programming
• How to Burn a Graph

This page was built for publication: Burning grids and intervals