scientific article; zbMATH DE number 7801748

MaRDI QIDQ6189392

Wei Fan Wang, Jiacheng Hu

Publication date: 8 February 2024

Full work available at URL: https://applmath.cjoe.ac.cn/jweb_yysxxb/EN/Y2023/V46/I4/493

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cycleplanar graphfirefighter problemsurviving rate

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• The 2-surviving rate of planar graphs without 5-cycles
• Slash and burn on graphs -- firefighting with general weights
• Steinberg's conjecture is false
• The 2-surviving rate of planar graphs without 6-cycles
• The surviving rate of digraphs
• Planar graph is on fire
• A note on the surviving rate of 1-planar graphs
• The surviving rate of an infected network
• The 2-surviving rate of planar graphs without 4-cycles
• Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly
• The surviving rate of planar graphs
• Planar graphs without chordal 5-cycles are 2-good
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• A note on the three color problem
• A lower bound of the surviving rate of a planar graph with girth at least seven
• Surviving rate of graphs and firefighter problem
• Structural properties and surviving rate of planar graphs
• Surviving Rates of Graphs with Bounded Treewidth for the Firefighter Problem
• The Surviving Rate of a Graph for the Firefighter Problem
• The 2‐surviving rate of planar graphs with average degree lower than
• Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
• Fire Containment in Planar Graphs
• Sparse Graphs Are Not Flammable

This page was built for publication: