Orienting edges to fight fire in graphs

MaRDI QIDQ4616090zbMATH OpenFDO

Authors Julien Bensmail, Nick Brettell

Publication date 30 January 2019

Full work available at URL https://arxiv.org/abs/1506.07338, http://ajc.maths.uq.edu.au/pdf/71/ajc_v71_p012.pdf

zbMATH Keywords

optimal firefighting strategies

Mathematics Subject Classification ID

Games on graphs (graph-theoretic aspects) (05C57) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 1802810
• The firefighter problem on graph classes
• The Firefighter problem: a survey of results, directions and questions
• The firefighter problem with subdividing edges on graphs of maximum degree three
• The firefighter problem for cubic graphs

Cites work

• Average firefighting on infinite grids
• Distances in orientations of graphs
• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• The firefighter problem for cubic graphs
• The firefighter problem for graphs of maximum degree three
• The firefighter problem for regular infinite directed grids
• The Firefighter problem: a survey of results, directions and questions
• The surviving rate of digraphs

Cited in

(1)

• scientific article; zbMATH DE number 5016646 (Why is no real title available?)

This page was built for publication: Orienting edges to fight fire in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4616090)