Hits :

First Author : Weifan Wang

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2018-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.35

Issue : No.3

Page Number : 980-996

ISSN : 1382-6905;1573-2886

Translation or Not : no

Key Words : Firefighter;problem;Surviving;rate;Planar;graph;Cycle;Chord

Abstract : Let G be a connected graph with \(n\ge 2\) vertices. Suppose that a fire breaks out at a vertex v of G. A firefighter starts to protect vertices. At each step, the firefighter protects two vertices not yet on fire. At the end of each step, the fire spread