Graphs of small bandwidth and the firefighter problem
From MaRDI portal
Cites work
- A remark on a problem of Harary
- Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
- scientific article; zbMATH DE number 4070955 (Why is no real title available?)
- scientific article; zbMATH DE number 2061798 (Why is no real title available?)
- Optimal Assignments of Numbers to Vertices
- Surviving rates of graphs with bounded treewidth for the firefighter problem
- The bandwidth problem for graphs and matrices—a survey
- The Firefighter problem: a survey of results, directions and questions
- The NP-completeness of the bandwidth minimization problem
This page was built for publication: Graphs of small bandwidth and the firefighter problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7402519)