Hits :

First Author : Tingting Wu

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

Date of Publication : 2016-01-01

Document Type : 期刊

Journal : Journal of Combinatorial Optimization

Volume: Vol.31

Issue : No.4

Page Number : 1479-1492

ISSN : 1382-6905;1573-2886

Translation or Not : no

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

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