{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T23:13:02Z","timestamp":1767827582948,"version":"3.49.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046507","type":"print"},{"value":"9783030046514","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_46","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"681-695","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Integer-Programming Bounds on Pebbling Numbers of Cartesian-Product Graphs"],"prefix":"10.1007","author":[{"given":"Franklin","family":"Kenter","sequence":"first","affiliation":[]},{"given":"Daphne","family":"Skipper","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"issue":"2","key":"46_CR1","first-page":"246","volume":"71","author":"J Asplund","year":"2017","unstructured":"Asplund, J., Hurlbert, G., Kenter, F.: Pebbling on graph products and other binary graph constructions. Australas. J. Comb. 71(2), 246\u2013260 (2017)","journal-title":"Australas. J. Comb."},{"issue":"4","key":"46_CR2","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0402041","volume":"2","author":"F Chung","year":"1989","unstructured":"Chung, F.: Pebbling in hypercubes. SIAM J. Discrete Math. 2(4), 467\u2013472 (1989)","journal-title":"SIAM J. Discrete Math."},{"key":"46_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-642-20807-2_9","volume-title":"Integer Programming and Combinatoral Optimization","author":"W Cook","year":"2011","unstructured":"Cook, W., Koch, T., Steffy, D.E., Wolter, K.: An exact rational mixed-integer programming solver. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 104\u2013116. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_9"},{"issue":"1","key":"46_CR4","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s10878-016-0060-6","volume":"34","author":"DW Cranston","year":"2017","unstructured":"Cranston, D.W., Postle, L., Xue, C., Yerger, C.: Modified linear programming and class 0 bounds for graph pebbling. J. Comb. Optim. 34(1), 114\u2013132 (2017). https:\/\/doi.org\/10.1007\/s10878-016-0060-6","journal-title":"J. Comb. Optim."},{"key":"46_CR5","unstructured":"Cusack, C.A., Green, A., Bekmetjev, A., Powers, M.: Graph pebbling algorithms and Lemke graphs. Submitted"},{"key":"46_CR6","first-page":"A17","volume":"5","author":"S Elledge","year":"2005","unstructured":"Elledge, S., Hurlbert, G.H.: An application of graph pebbling to zero-sum sequences in Abelian groups. Integers 5, A17 (2005)","journal-title":"Integers"},{"issue":"4","key":"46_CR7","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/BF02872335","volume":"45","author":"R Feng","year":"2002","unstructured":"Feng, R., Kim, J.Y.: Pebbling numbers of some graphs. Sci. China Ser. A Math. 45(4), 470\u2013478 (2002). https:\/\/doi.org\/10.1007\/BF02872335","journal-title":"Sci. China Ser. A Math."},{"key":"46_CR8","unstructured":"Gurobi Optimization Inc.: http:\/\/www.gurobi.com"},{"issue":"2","key":"46_CR9","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/jgt.10080","volume":"42","author":"DS Herscovici","year":"2003","unstructured":"Herscovici, D.S.: Graham\u2019s pebbling conjecture on products of cycles. J. Graph Theory 42(2), 141\u2013154 (2003). https:\/\/doi.org\/10.1002\/jgt.10080","journal-title":"J. Graph Theory"},{"issue":"1","key":"46_CR10","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0012-365X(97)00229-X","volume":"187","author":"DS Herscovici","year":"1998","unstructured":"Herscovici, D.S., Higgins, A.W.: The pebbling number of $${C_5} \\times {C_5}$$. Discrete Math. 187(1), 123\u2013135 (1998). https:\/\/doi.org\/10.1016\/S0012-365X(97)00229-X","journal-title":"Discrete Math."},{"key":"46_CR11","unstructured":"Hurlbert, G.: A linear optimization technique for graph pebbling. arXiv e-prints, January 2011"},{"key":"46_CR12","first-page":"1428","volume-title":"Handbook of Graph Theory","author":"G Hurlbert","year":"2013","unstructured":"Hurlbert, G.: Graph pebbling. In: Gross, J.L., Yellen, J., Zhang, P. (eds.) Handbook of Graph Theory, pp. 1428\u20131449. Chapman and Hall\/CRC, Kalamazoo (2013)"},{"issue":"3","key":"46_CR13","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/0022-314X(89)90077-2","volume":"31","author":"P Lemke","year":"1989","unstructured":"Lemke, P., Kleitman, D.: An addition theorem on the integers modulo n. J. Number Theory 31(3), 335\u2013345 (1989). https:\/\/doi.org\/10.1016\/0022-314X(89)90077-2","journal-title":"J. Number Theory"},{"issue":"3","key":"46_CR14","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1137\/050636218","volume":"20","author":"K Milans","year":"2006","unstructured":"Milans, K., Clark, B.: The complexity of graph pebbling. SIAM J. Discrete Math. 20(3), 769\u2013798 (2006). https:\/\/doi.org\/10.1137\/050636218","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"46_CR15","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1137\/050636218","volume":"16","author":"HS Snevily","year":"2000","unstructured":"Snevily, H.S., Foster, J.A.: The 2-pebbling property and a conjecture of Graham\u2019s. Graphs Comb. 16(2), 231\u2013244 (2000). https:\/\/doi.org\/10.1137\/050636218","journal-title":"Graphs Comb."},{"issue":"1","key":"46_CR16","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/S0012-365X(00)00177-1","volume":"226","author":"S Wang","year":"2001","unstructured":"Wang, S.: Pebbling and Graham\u2019s conjecture. Discrete Math. 226(1), 431\u2013438 (2001). https:\/\/doi.org\/10.1016\/S0012-365X(00)00177-1","journal-title":"Discrete Math."},{"issue":"10","key":"46_CR17","doi-asserted-by":"publisher","first-page":"3431","DOI":"10.1016\/j.disc.2008.09.045","volume":"309","author":"Z Wang","year":"2009","unstructured":"Wang, Z., Zou, Y., Liu, H., Wang, Z.: Graham\u2019s pebbling conjecture on product of thorn graphs of complete graphs. Discrete Math. 309(10), 3431\u20133435 (2009). https:\/\/doi.org\/10.1016\/j.disc.2008.09.045","journal-title":"Discrete Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:52:15Z","timestamp":1710345135000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}