Graphs with average degree smaller than 3011 burn slowly

DOI10.1007/S00373-012-1265-9zbMATH Open1298.05225OpenAlexW2001001176MaRDI QIDQ742585FDOQ742585

Authors: Paweł Prałat 

Publication date: 19 September 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-012-1265-9

Recommendations

• Sparse graphs are not flammable
• The surviving rate of a graph for the firefighter problem
• The edge surviving rate of a class of planar graphs for the firefighter problem
• The 2-surviving rate of planar graphs with average degree lower than \(\frac{9}{2}\)
• Surviving rates of graphs with bounded treewidth for the firefighter problem

zbMATH Keywords

random graphssurviving ratefirefighter

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Title not available (Why is that?)
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Expander graphs and their applications
• Title not available (Why is that?)
• Explicit construction of linear sized tolerant networks
• The firefighter problem for graphs of maximum degree three
• Surviving rates of graphs with bounded treewidth for the firefighter problem
• The surviving rate of a graph for the firefighter problem
• The Firefighter problem: a survey of results, directions and questions
• Title not available (Why is that?)
• Sparse graphs are not flammable
• The surviving rate of an infected network
• Firefighting on trees: How bad is the greedy algorithm?
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Title not available (Why is that?)
• A proof of alon's second eigenvalue conjecture

Cited In (12)

• Surviving rate of graphs and firefighter problem
• Planar graph is on fire
• Firefighting as a strategic game
• Asymptotic surviving rate of trees with multiple fire sources
• The surviving rate of a graph for the firefighter problem
• Sparse graphs are not flammable
• The firefighter problem: empirical results on random graphs
• A lower bound of the surviving rate of a planar graph with girth at least seven
• Burning graphs: a probabilistic perspective
• Fighting constrained fires in graphs
• Firefighting on square, hexagonal, and triangular grids
• The surviving rate of planar graphs without short cycles

This page was built for publication: Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q742585)