Author:
Lind M.,Fiorini E.,Woldar A.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference16 articles.
1. Anilkumar, M. S., Sreedevi, S.: A comprehensive review on graph pebbling and rubbling. J.Phys. Conf. Ser. 1531. (2nd International Conference on Recent Advances in Fundamental and Applied Sciences RAFAS, 5–6 November 2019, Punjab, India) (2019)
2. Bailey, D.H., Borwein, J.M.: Experimental mathematics: examples, methods, and implications. Notices Am. Math. Soc. 52, 502–514 (2005)
3. Lecture Notes in Computer Science;J Blocki,2018
4. Bukh, B.: Maximum pebbling number of graphs of diameter three. J. Graph Theory 52, 353–357 (2006)
5. Clarke, T., Hochberg, R., Hurlbert, G.: Pebbling in diameter two graphs and products of paths. J. Graph Theory 25(2), 119–128 (1997)