Now showing items 1-1 of 1

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

      Wang, Weifan; Kong, Jiangxu; Zhang, Lianzhu; 张莲珠 (ELSEVIER SCIENCE BV, 2012-10-26)
      Let G be a connected graph with n >= 2 vertices. Suppose that a fire breaks out at a vertex v of G. A firefighter starts to protect vertices. At each time interval, the firefighter protects two vertices not yet on fire. ...