Planar graphs without chordal 5-cycles are 2-good
Authors:
- 29 January 2018
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 35 (3) , 980-996
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- More fires and more fightersDiscrete Applied Mathematics, 2013
- The firefighter problem with more than one firefighter on treesDiscrete Applied Mathematics, 2013
- The 2-surviving rate of planar graphs without 4-cyclesTheoretical Computer Science, 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
- The firefighter problem for graphs of maximum degree threeDiscrete Mathematics, 2007
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979