{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T15:59:32Z","timestamp":1770220772660,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,3,24]],"date-time":"2012-03-24T00:00:00Z","timestamp":1332547200000},"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,7]]},"DOI":"10.1007\/s00373-012-1152-4","type":"journal-article","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T18:30:37Z","timestamp":1332527437000},"page":"955-975","source":"Crossref","is-referenced-by-count":17,"title":["t-Pebbling and Extensions"],"prefix":"10.1007","volume":"29","author":[{"given":"D. S.","family":"Herscovici","sequence":"first","affiliation":[]},{"given":"B. D.","family":"Hester","sequence":"additional","affiliation":[]},{"given":"G. H.","family":"Hurlbert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,24]]},"reference":[{"issue":"2","key":"1152_CR1","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1137\/080724277","volume":"23","author":"A. Bekmetjev","year":"2009","unstructured":"Bekmetjev A., Cusack C.: Pebbling algorithms in diameter two graphs. SIAM J. Discret. Math. 23(2), 634\u2013646 (2009)","journal-title":"SIAM J. Discret. Math."},{"key":"1152_CR2","first-page":"83","volume":"42","author":"A. Blasiak","year":"2008","unstructured":"Blasiak A., Schmitt J.: Degree sum conditions in graph pebbling. Australas. J. Combin. 42, 83\u201390 (2008)","journal-title":"Australas. J. Combin."},{"key":"1152_CR3","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1002\/jgt.20187","volume":"52","author":"B. Bukh","year":"2006","unstructured":"Bukh B.: Maximum pebbling numbers of graphs of diameter three. J. Graph Theory 52, 353\u2013357 (2006)","journal-title":"J. Graph Theory"},{"key":"1152_CR4","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, 215\u2013238 (2008)","journal-title":"J. Graph Theory"},{"issue":"4","key":"1152_CR5","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0402041","volume":"2","author":"F.R.K. Chung","year":"1989","unstructured":"Chung F.R.K.: Pebbling in hypercubes. SIAM J. Discret. Math. 2(4), 467\u2013472 (1989)","journal-title":"SIAM J. Discret. Math."},{"key":"1152_CR6","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, 119\u2013128 (1997)","journal-title":"J. Graph Theory"},{"issue":"#G2","key":"1152_CR7","first-page":"411","volume":"9","author":"D. Curtis","year":"2009","unstructured":"Curtis D., Hines T., Hurlbert G., Moyer T.: On pebbling graphs by their blocks. Integers. Electron. J. Combin. Number Theory 9(#G2), 411\u2013422 (2009)","journal-title":"Integers. Electron. J. Combin. Number Theory"},{"issue":"2","key":"1152_CR8","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1002\/jgt.10080","volume":"42","author":"D.S. Herscovici","year":"2003","unstructured":"Herscovici D.S.: Graham\u2019s pebbling conjecture on products of cycles. J. Graph Theory 42(2), 141\u2013154 (2003)","journal-title":"J. Graph Theory"},{"key":"1152_CR9","unstructured":"Hurlbert, G.: The graph pebbling page. http:\/\/mingus.la.asu.edu\/~hurlbert\/pebbling\/pebb.html"},{"key":"1152_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0012-365X(98)00154-X","volume":"190","author":"D. Moews","year":"1998","unstructured":"Moews D.: Optimally pebbling hypercubes and powers. Discret. Math. 190, 271\u2013276 (1998)","journal-title":"Discret. Math."},{"key":"1152_CR11","first-page":"65","volume":"107","author":"L. Pachter","year":"1995","unstructured":"Pachter L., Snevily H.S., Voxman B.: On pebbling graphs. Congr. Numer. 107, 65\u201380 (1995)","journal-title":"Congr. Numer."},{"key":"1152_CR12","doi-asserted-by":"crossref","unstructured":"Postle, L., Streib, N., Yerger, C.: Pebbling graphs of diameter three and four. In: European Conference on Combinatorics, Graph Theory and Applications (EuroComb 2009). Electron. Notes Discrete Math., vol. 34, pp. 21\u201328. Elsevier, Amsterdam (2009)","DOI":"10.1016\/j.endm.2009.07.004"},{"key":"1152_CR13","unstructured":"Scheinerman, E.R., Ullman, D.H.: Fractional Graph Theory: A Rational Approach to the Theory of Graphs. Wiley, New York (1997)"},{"key":"1152_CR14","unstructured":"Watson, N.: The complexity of pebbling and cover pebbling (2005). http:\/\/arXiv.org\/abs\/math.CO\/0503511"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1152-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1152-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1152-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T01:06:44Z","timestamp":1561511204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1152-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,24]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1152"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1152-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,24]]}}}