The 2-surviving rate of planar graphs without 4-cycles

DOI10.1016/J.TCS.2012.07.011MaRDI QIDQ714853zbMATH OpenOpenAlexFDO

Authors Jiangxu Kong, Weifan Wang, Lianzhu Zhang

Publication date 11 October 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.07.011

zbMATH Keywords

cycleplanar graphfirefighter problem2-surviving rate

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Recommendations

• The 2-surviving rate of planar graphs without 5-cycles
• The edge surviving rate of a class of planar graphs for the firefighter problem
• The 2-surviving rate of planar graphs without 6-cycles
• The 2-surviving rate of planar graphs with average degree lower than \(\frac{9}{2}\)
• The surviving rate of planar graphs

Cites work

• scientific article; zbMATH DE number 2061798 (Why is no real title available?)
• scientific article; zbMATH DE number 1506515 (Why is no real title available?)
• A lower bound of the surviving rate of a planar graph with girth at least seven
• Allee effect and control of lake system invasion
• Fire Containment in Planar Graphs
• Surviving rates of graphs with bounded treewidth for the firefighter problem
• The Firefighter problem: a survey of results, directions and questions
• The firefighter problem for cubic graphs
• The firefighter problem for graphs of maximum degree three
• The surviving rate of a graph for the firefighter problem
• The surviving rate of an infected network
• The surviving rate of an outerplanar graph for the firefighter problem
• The surviving rate of planar graphs

Cited in

(18)

• The surviving rate of digraphs
• Surviving rate of graphs and firefighter problem
• The 2-surviving rate of planar graphs without 5-cycles
• Solving the geometric firefighter routing problem via integer programming
• Planar graphs without chordal 5-cycles are 2-good
• The 2-surviving rate of planar graphs without 6-cycles
• Finding exact solutions for the geometric firefighter problem in practice
• Planar graph is on fire
• The surviving rate of planar graphs
• The edge surviving rate of a class of planar graphs for the firefighter problem
• The 2-surviving rate of planar graphs with average degree lower than \(\frac{9}{2}\)
• The surviving rate of some oriented planar graphs
• Asymptotic surviving rate of trees with multiple fire sources
• Firefighting as a strategic game
• The firefighter problem: empirical results on random graphs
• A lower bound of the surviving rate of a planar graph with girth at least seven
• The surviving rate of planar graphs without short cycles
• A note on the surviving rate of 1-planar graphs

This page was built for publication: The 2-surviving rate of planar graphs without 4-cycles

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