Planar graphs without chordal 5-cycles are 2-good

DOI10.1007/s10878-017-0243-9zbMath1393.05094OpenAlexW2787771914MaRDI QIDQ1743499

Tingting Wu, Xiaoxue Hu, Yi Qiao Wang, Wei Fan Wang

Publication date: 13 April 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0243-9

zbMATH Keywords

cycleplanar graphchordfirefighter problemsurviving rate

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items

Surviving rate of graphs and firefighter problem ⋮ Optimal \(r\)-dynamic coloring of sparse graphs ⋮ Unnamed Item

Cites Work

• Unnamed Item
• The 2-surviving rate of planar graphs without 5-cycles
• The 2-surviving rate of planar graphs without 6-cycles
• Planar graph is on fire
• The surviving rate of an infected network
• The 2-surviving rate of planar graphs without 4-cycles
• The surviving rate of planar graphs
• The firefighter problem for cubic graphs
• The firefighter problem with more than one firefighter on trees
• A lower bound of the surviving rate of a planar graph with girth at least seven
• The firefighter problem for graphs of maximum degree three
• More fires and more fighters
• Structural properties and surviving rate of planar graphs
• A note on 3-choosability of plane graphs under distance restrictions
• Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
• The Surviving Rate of a Graph for the Firefighter Problem
• A Separator Theorem for Planar Graphs
• On the minimum vertex covering transversal dominating sets in graphs and their classification
• Fire Containment in Planar Graphs
• Radio k-chromatic number of cycles for large k
• On certain parameters of equitable coloring of graphs
• Sparse Graphs Are Not Flammable