Adversarial graph burning densities
From MaRDI portal
Publication:6635110
DOI10.1016/J.DISC.2024.114253MaRDI QIDQ6635110
William Kellough, Karen Gunderson, Hritik Punj, J. D. Nir
Publication date: 9 November 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pursuit evasion on infinite graphs
- Transmitting in the \(n\)-dimensional cube
- Bounds on the burning number
- Energy parity games
- Maker-breaker percolation games. II: Escaping to infinity
- Burning graphs: a probabilistic perspective
- Burning the plane. Densities of the infinite Cartesian grid
- Strong Ramsey games: drawing on an infinite board
- Burning a Graph as a Model of Social Contagion
- Random Trees
- How to Burn a Graph
- Improved pyrotechnics: closer to the burning number conjecture
- The burning number conjecture holds asymptotically
This page was built for publication: Adversarial graph burning densities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635110)
