Author:
Ashok Pradeesha,Das Sayani,Kanesh Lawqueen,Saurabh Saket,Tomar Avi,Verma Shaily
Publisher
Springer Nature Switzerland
Reference13 articles.
1. Bessy, S., Bonato, A., Janssen, J., Rautenbach, D., Roshanbin, E.: Burning a graph is hard. Discret. Appl. Math. 232, 73–87 (2017)
2. Bonato, A.: A survey of graph burning. arXiv preprint arXiv:2009.10642 (2020)
3. Lecture Notes in Computer Science;A Bonato,2014
4. Bonato, A., Janssen, J., Roshanbin, E.: How to burn a graph. Internet Math. 12(1–2), 85–100 (2016)
5. Cygan, M., et al.: Parameterized Algorithms, vol. 5. Springer, Heidelberg (2015)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Orientable Burning Number of Graphs;Lecture Notes in Computer Science;2024