On the burning number of generalized Petersen graphs
From MaRDI portal
(Redirected from Publication:723638)
Recommendations
Cites work
Cited in
(18)- Burning numbers of path forests and spiders
- On the burning number of \(p\)-caterpillars
- Burning numbers of \(t\)-unicyclic graphs
- Surviving rate of graphs and firefighter problem
- The generalized burning number of graphs
- Burning number of theta graphs
- Graph burning: tight bounds on the burning numbers of path forests and spiders
- The burning numbers of generalized Peterson graphs P(n, 1) and P(n, 2)
- APX-hardness and approximation for the \(k\)-burning number problem
- Burning Numbers of Barbells
- Burning number of Jahangir graphs
- Burning disjoint union of spider and path
- From burning extremal balanced spiders into properties for generalization to all trees
- Approximation algorithms for the graph burning on cactus and directed trees
- A row generation algorithm for finding optimal burning sequences of large graphs
- The generalized burning number of caterpillars
- On the burning number of the generalized Heawood graphs
- Burning number of caterpillars
This page was built for publication: On the burning number of generalized Petersen graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q723638)