A survey of graph burning (Q4986283): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Burning a graph is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743189 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for burning fence graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning the plane. Densities of the infinite Cartesian grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning a Graph as a Model of Social Contagion / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Burn a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for graph burning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the burning numbers of spiders and path-forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Throttling for the game of cops and robbers on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning spiders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-decompositions with bags of small diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Burning Number of Directed Graphs: Bounds and Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning Two Worlds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for Graph Burning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Graph Burning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the burning number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning number of caterpillars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning number of theta graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burning graphs: a probabilistic perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph burning: tight bounds on the burning numbers of path forests and spiders / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank

Revision as of 15:01, 25 July 2024

scientific article; zbMATH DE number 7339695
Language Label Description Also known as
English
A survey of graph burning
scientific article; zbMATH DE number 7339695

    Statements

    0 references
    27 April 2021
    0 references
    graph burning
    0 references
    trees
    0 references
    graph families
    0 references
    graph products
    0 references
    random graphs
    0 references
    graph algorithms
    0 references
    A survey of graph burning (English)
    0 references

    Identifiers