The surviving rate of digraphs

DOI10.1016/J.DISC.2014.06.018zbMATH Open1297.05099OpenAlexW2053514817MaRDI QIDQ396728FDOQ396728

Authors: Jiangxu Kong, Lianzhu Zhang, Weifan Wang 

Publication date: 14 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.018

Recommendations

• On the girth of digraphs
• The digrundy number of digraphs
• scientific article; zbMATH DE number 568850
• The surviving rate of planar graphs
• scientific article; zbMATH DE number 5920059
• The diachromatic number of digraphs
• Majority digraphs
• The surviving rate of some oriented planar graphs
• Species on digraphs
• Note on the regular digraphs

zbMATH Keywords

digraphplanar graphfirefighter problemsurviving ratedischarging

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• A lower bound of the surviving rate of a planar graph with girth at least seven
• The firefighter problem for graphs of maximum degree three
• Structural properties and surviving rate of planar graphs
• Surviving rates of graphs with bounded treewidth for the firefighter problem
• The surviving rate of a graph for the firefighter problem
• The Firefighter problem: a survey of results, directions and questions
• The 2-surviving rate of planar graphs without 6-cycles
• Fire Containment in Planar Graphs
• The surviving rate of an infected network
• The 2-surviving rate of planar graphs without 4-cycles
• The surviving rate of planar graphs
• The firefighter problem for cubic graphs
• The surviving rate of an outerplanar graph for the firefighter problem
• Title not available (Why is that?)

Cited In (8)

• Surviving rate of graphs and firefighter problem
• Solving the geometric firefighter routing problem via integer programming
• Finding exact solutions for the geometric firefighter problem in practice
• Species on digraphs
• The surviving rate of an infected network
• Orienting edges to fight fire in graphs
• Estimation of distribution algorithms for the firefighter problem
• The surviving rate of planar graphs without short cycles

This page was built for publication: The surviving rate of digraphs

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