A note on graph burning of path forests

DOI10.46298/DMTCS.12709MaRDI QIDQ6987000zbMATH OpenFDO

Authors Ta Sheng Tan, Wen Chean Teh

Publication date 7 May 2025

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license arXiv.org Non-exclusive license to distribute

Full work available at URL https://doi.org/10.46298/DMTCS.12709

zbMATH Keywords

burning number conjecturediscrete graph algorithmspread of social contagionsumset partition of integerswell-burnable

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph algorithms (graph-theoretic aspects) (05C85) Epidemiology (92D30)

Cites work

• A survey of graph burning
• Algorithms and discrete applied mathematics. 4th international conference, CALDAM 2018, Guwahati, India, February 15--17, 2018. Proceedings
• Bounds on the burning numbers of spiders and path-forests
• Burnability of double spiders and path forests
• Burning a graph is hard
• Burning number of caterpillars
• Disjoint odd integer subsets having a constant even sum
• Disjoint odd integer subsets having a constant odd sum
• Disjoint subsets of integers having a constant sum
• Graph burning: tight bounds on the burning numbers of path forests and spiders
• How to Burn a Graph
• On the ascending star subgraphs decomposition of star forests
• On the modular sumset partition problem
• Partition of a set of integers into subsets with prescribed sums
• The burning number conjecture holds asymptotically

Cited in

(2)

• Burning disjoint union of spider and path
• From burning extremal balanced spiders into properties for generalization to all trees

This page was built for publication: A note on graph burning of path forests

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