{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T06:09:13Z","timestamp":1769148553342,"version":"3.49.0"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,3,11]],"date-time":"2012-03-11T00:00:00Z","timestamp":1331424000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00373-012-1146-2","type":"journal-article","created":{"date-parts":[[2012,3,10]],"date-time":"2012-03-10T07:21:57Z","timestamp":1331364117000},"page":"535-551","source":"Crossref","is-referenced-by-count":6,"title":["Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Gyula Y.","family":"Katona","sequence":"first","affiliation":[]},{"given":"N\u00e1ndor","family":"Sieben","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,11]]},"reference":[{"issue":"10","key":"1146_CR1","doi-asserted-by":"crossref","first-page":"3436","DOI":"10.1016\/j.disc.2008.09.035","volume":"309","author":"C. Belford","year":"2009","unstructured":"Belford C., Sieben N.: Rubbling and optimal rubbling of graphs. Discrete Math. 309(10), 3436\u20133446 (2009)","journal-title":"Discrete Math."},{"issue":"4","key":"1146_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/jgt.20187","volume":"52","author":"B. Bukh","year":"2006","unstructured":"Bukh B.: Maximum pebbling number of graphs of diameter three. J. Graph Theory 52(4), 353\u2013357 (2006)","journal-title":"J. Graph Theory"},{"issue":"3","key":"1146_CR3","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/jgt.20278","volume":"57","author":"D.P. Bunde","year":"2008","unstructured":"Bunde D.P., Chambers E.W., Cranston D., Milans K., West D.B.: Pebbling and optimal pebbling in graphs. J. Graph Theory 57(3), 215\u2013238 (2008)","journal-title":"J. Graph Theory"},{"issue":"11","key":"1146_CR4","doi-asserted-by":"crossref","first-page":"2301","DOI":"10.1016\/j.disc.2006.06.032","volume":"308","author":"M. Chan","year":"2008","unstructured":"Chan M., Godbole A.P.: Improved pebbling bounds. Discrete Math. 308(11), 2301\u20132306 (2008)","journal-title":"Discrete Math."},{"issue":"2","key":"1146_CR5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/(SICI)1097-0118(199706)25:2<119::AID-JGT3>3.0.CO;2-P","volume":"25","author":"T.A. Clarke","year":"1997","unstructured":"Clarke T.A., Hochberg R.A., Hurlbert G.H.: Pebbling in diameter two graphs and products of paths. J. Graph Theory 25(2), 119\u2013128 (1997)","journal-title":"J. Graph Theory"},{"key":"1146_CR6","unstructured":"Danz, L.: Optimal t-rubbling of complete m-ary trees. University of Minnesota Duluth, Department of Mathematics and Statistics, REU project report (2010)"},{"key":"1146_CR7","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1090\/S0002-9904-1948-09098-X","volume":"54","author":"M. Hall Jr","year":"1948","unstructured":"Hall M. Jr: Distinct representatives of subsets. Bull. Amer. Math. Soc. 54, 922\u2013926 (1948)","journal-title":"Bull. Amer. Math. Soc."},{"key":"1146_CR8","unstructured":"Hurlbert, G.: A survey of graph pebbling. In: Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing, vol. 139, pp. 41\u201364. Boca Raton, FL (1999)"},{"key":"1146_CR9","first-page":"25","volume":"49","author":"G. Hurlbert","year":"2005","unstructured":"Hurlbert G.: Recent progress in graph pebbling. Graph Theory Notes N.Y. 49, 25\u201337 (2005)","journal-title":"Graph Theory Notes N.Y."},{"key":"1146_CR10","unstructured":"McKay, B.D.: Practical graph isomorphism. In: Proceedings of the Tenth Manitoba Conference on Numerical Mathematics and Computing, vol. I (Winnipeg, Man., 1980), vol. 30, pp. 45\u201387 (1981)"},{"key":"1146_CR11","doi-asserted-by":"crossref","unstructured":"Milans, K., Clark, B.: The complexity of graph pebbling. SIAM J. Discrete Math. 20(3), 769\u2013798 (2006, electronic)","DOI":"10.1137\/050636218"},{"issue":"17-18","key":"1146_CR12","doi-asserted-by":"crossref","first-page":"2315","DOI":"10.1016\/j.disc.2006.11.005","volume":"307","author":"J. Muntz","year":"2007","unstructured":"Muntz J., Narayan S., Streib N., VanOchten K.: Optimal pebbling of graphs. Discrete Math 307((17-18), 2315\u20132321 (2007)","journal-title":"Discrete Math"},{"key":"1146_CR13","unstructured":"Pachter, L., Snevily, H.S., Voxman, B.: On pebbling graphs. In: Proceedings of the Twenty-sixth outheastern International Conference on Combinatorics, Graph Theory and Computing, vol. 107, pp. 65\u201380. Boca Raton, FL (1995)"},{"key":"1146_CR14","unstructured":"Papp, L.: Optimal rubbling numbers of graphs (in Hungarian), thesis, Budapest University of Technology and Economics, Department of Computer Science and Information Theory (2010)"},{"issue":"2","key":"1146_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.7155\/jgaa.00205","volume":"14","author":"N. Sieben","year":"2010","unstructured":"Sieben N.: A graph pebbling algorithm on weighted graphs. J.Graph Algorithms Appl. 14(2), 221\u2013244 (2010)","journal-title":"J.Graph Algorithms Appl."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1146-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1146-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1146-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T04:36:53Z","timestamp":1561437413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1146-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,11]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["1146"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1146-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,11]]}}}