A note on the surviving rate of 1-planar graphs

DOI10.1016/j.disc.2016.11.005zbMath1357.05026OpenAlexW2557575922MaRDI QIDQ512598

Jiangxu Kong, Lian Zhu Zhang

Publication date: 27 February 2017

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

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

zbMATH Keywords

firefighter problemsurviving rate1-planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (3)

Surviving rate of graphs and firefighter problem ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• The 2-surviving rate of planar graphs without 5-cycles
• The 2-surviving rate of planar graphs without 6-cycles
• Planar graph is on fire
• The surviving rate of an outerplanar graph for the firefighter problem
• 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
• Graphs drawn with few crossings per edge
• On edge colorings of \(1\)-planar graphs
• 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
• Fire Containment in Planar Graphs

This page was built for publication: A note on the surviving rate of 1-planar graphs