Burning Numbers of Barbells
From MaRDI portal
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Social networks; opinion dynamics (91D30)
Recommendations
Cites work
- A survey of graph burning
- Bounds on the burning number
- Bounds on the burning numbers of spiders and path-forests
- Burning a graph as a model of social contagion
- Burning a graph is hard
- Burning graphs: a probabilistic perspective
- Burning number of caterpillars
- Burning number of graph products
- Burning number of theta graphs
- Burning numbers of \(t\)-unicyclic graphs
- Burning numbers of path forests and spiders
- Cleaning regular graphs with brushes
- Firefighting on a random geometric graph
- Graph bootstrap percolation
- How to Burn a Graph
- On the burning number of generalized Petersen graphs
- The Firefighter problem: a survey of results, directions and questions
- The game of cops and robbers on graphs
This page was built for publication: Burning Numbers of Barbells
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489821)