Planar graphs without chordal 5-cycles are 2-good

Let k and n be two positive integers. Firefighting is a discrete dynamical process of preventing the spread of fire. Let G be a connected graph G with n vertices. Assuming a fire starts at one of the vertices of G, the firefighters choose k unburned vertices at each step, and then the fire spreads to all unprotected neighbors of the burning vertices. The process continues until the fire stops spreading. The goal is to protect as many vertices as possible. When a fire breaks out randomly at a vertex of G, its k-surviving rate, ρk(G), is the expected number of saved vertices. A graph is IC-planar if it has a drawing in which each edge cross once and their endpoints are disjoint. In this paper, we prove that ρ4(G)>1124 for every IC-planar graph G. This is proven by the discharging method and the locally symmetric of the graph.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Planar graphs without chordal 5-cycles are 2-good

Cited by 3 publications

References 20 publications

Optimal r-dynamic coloring of sparse graphs

Optimal r-dynamic coloring of sparse graphs

Surviving rate of graphs and Firefighter Problem

The Surviving Rate of IC-Planar Graphs

Contact Info

Product

Resources

About