Papers related to Optimal pebbling number

  1. D.P. Bunde, E.W. Chambers, D. Cranston, K. Milans, D.B.West, Pebbling and optimal pebbling in graphs, preprint, 2005.
  2. L. Patcher, H. Snevily, B. Voxman, On pebbling graphs, in: Proceedings of the 26th Southeastern International Conference on Combinatorics, Graph Theory, and Computing, vol. 107, Boca Raton, FL, 1995, 65–80.
  3. T. Friedman and C. Wyels. Optimal pebbling of paths and cycles. Discr. Math., submitted (Mathematics ArXiv Article math.CO/0506076).
  4. Hung-Lin Fu and Chin-Lin Shiue, The optimal pebbling number of the complete m-ary tree, Discrete Math. 22 (2000), no. 1-3, 89–100.
  5. David Moews, Optimally pebbling hypercubes and powers, Discrete Math. 190 (1998), no. 1-3, 271–276.
  6. Jessica Muntz, Sivaram Narayana, Noah Streib, Kelly Van Ochten, Optimal pebbling of graphs, Discrete Mathematics 307 (2007), 2315 - 2321.
  7. Ervin Gyori, Gyula Y. Katona, and L aszl o Papp, Optimal pebbling of grids.
  8. Chenxiao Xue, Carl Yerger, Optimal pebbling on grids, Graphs and Combinatorics, Volume 32, Issue 3 (2016), 1229–1247.
  9. Gyula Y. Katona, Nandor Sieben, Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs.
  10. Gyula Y. Katona and László F. Papp, The Optimal Rubbling Number of Ladders, Prisms and Mobius ladders, Discrete Applied Mathematics, Volume 209, (2016), 227-246.
  11. Christopher Belford and Nándor Sieben, Rubbling and optimal rubbling of graphs, Discrete Mathematics, Volume 309, Issue 10 (2009), 3436-3446.

Subscribe to: Posts (Atom)