The 2-surviving rate of planar graphs without 4-cycles
Authors:
- 1 October 2012
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 457, 158-165
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A lower bound of the surviving rate of a planar graph with girth at least sevenJournal of Combinatorial Optimization, 2012
- Fire Containment in Planar GraphsJournal of Graph Theory, 2012
- The surviving rate of planar graphsTheoretical Computer Science, 2012
- The surviving rate of an infected networkTheoretical Computer Science, 2010
- The firefighter problem for cubic graphsDiscrete Mathematics, 2010
- Surviving Rates of Graphs with Bounded Treewidth for the Firefighter ProblemSIAM Journal on Discrete Mathematics, 2010
- Allee Effect and Control of Lake System InvasionBulletin of Mathematical Biology, 2008
- The firefighter problem for graphs of maximum degree threeDiscrete Mathematics, 2007
- Percolation and epidemics in a two-dimensional small worldPhysical Review E, 2002
- Epidemic Spreading in Scale-Free NetworksPhysical Review Letters, 2001