Burning spiders

DOI10.1007/978-3-319-74180-2_13zbMath1500.05043OpenAlexW4230758742MaRDI QIDQ2636560

Arpan Sadhukhan, Subhadeep Ranjan Dev, Sandip Das, Sagnik Sen, Uma kant Sahoo

Publication date: 5 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-74180-2_13

zbMATH Keywords

burning number conjecturegraph burning

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Games involving graphs (91A43) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (10)

Burning grids and intervals ⋮ A survey of graph burning ⋮ Burning graph classes ⋮ Parameterized complexity of graph burning ⋮ Graph burning: tight bounds on the burning numbers of path forests and spiders ⋮ Burning and \(w\)-burning of geometric graphs ⋮ Burning Two Worlds ⋮ Parameterized Complexity of Graph Burning ⋮ APX-hardness and approximation for the \(k\)-burning number problem ⋮ Burnability of double spiders and path forests

This page was built for publication: Burning spiders