Planar graphs without chordal 5-cycles are 2-good

Weifan Wang, Tingting Wu, Xiaoxue Hu and Yiqiao Wang ()
Additional contact information
Weifan Wang: Zhejiang Normal University
Tingting Wu: Zhejiang Normal University
Xiaoxue Hu: Zhejiang Normal University
Yiqiao Wang: Beijing University of Chinese Medicine

Journal of Combinatorial Optimization, 2018, vol. 35, issue 3, No 18, 980-996

Abstract: Abstract Let G be a connected graph with $$n\ge 2$$ n ≥ 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 spreads to all the unprotected vertices that have a neighbour on fire. Let sn $$_2(v)$$ 2 ( v ) denote the maximum number of vertices in G that the firefighter can save when a fire breaks out at vertex v. The 2-surviving rate $$\rho _2(G)$$ ρ 2 ( G ) of G is defined to be the real number $$\frac{1}{n^2} \sum _{v\in V(G)} \mathrm{sn}_2(v)$$ 1 n 2 ∑ v ∈ V ( G ) sn 2 ( v ) . Then it is obvious that $$0 0$$ c > 0 such that $$\rho _2(G)>c$$ ρ 2 ( G ) > c . In this paper, we prove that every planar graph with $$n\ge 2$$ n ≥ 2 vertices and without chordal 5-cycles is 2-good.

Keywords: Firefighter problem; Surviving rate; Planar graph; Cycle; Chord (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0243-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:35:y:2018:i:3:d:10.1007_s10878-017-0243-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0243-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().