{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T02:38:48Z","timestamp":1769913528187,"version":"3.49.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,11,14]],"date-time":"2015-11-14T00:00:00Z","timestamp":1447459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Science of Slovenia","award":["P1-0297"],"award-info":[{"award-number":["P1-0297"]}]},{"name":"Ministry of Science of Slovenia","award":["P1-0297"],"award-info":[{"award-number":["P1-0297"]}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["209654"],"award-info":[{"award-number":["209654"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s00373-015-1647-x","type":"journal-article","created":{"date-parts":[[2015,11,14]],"date-time":"2015-11-14T06:41:30Z","timestamp":1447483290000},"page":"1313-1327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Packing Chromatic Number of Base-3 Sierpi\u0144ski Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Bo\u0161tjan","family":"Bre\u0161ar","sequence":"first","affiliation":[]},{"given":"Sandi","family":"Klav\u017ear","sequence":"additional","affiliation":[]},{"given":"Douglas F.","family":"Rall","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,14]]},"reference":[{"key":"1647_CR1","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/978-3-642-32147-4_28","volume":"7422","author":"G Argiroffo","year":"2012","unstructured":"Argiroffo, G., Nasini, G., Torres, P.: The packing coloring problem for $$(q, q-4)$$ ( q , q - 4 ) graphs. Lect. Notes Comp. Sci. 7422, 309\u2013319 (2012)","journal-title":"Lect. Notes Comp. Sci."},{"key":"1647_CR2","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.dam.2012.08.008","volume":"164","author":"G Argiroffo","year":"2014","unstructured":"Argiroffo, G., Nasini, G., Torres, P.: The packing coloring problem for lobsters and partner limited graphs. Discret. Appl. Math. 164, 373\u2013382 (2014)","journal-title":"Discret. Appl. Math."},{"key":"1647_CR3","doi-asserted-by":"crossref","first-page":"2303","DOI":"10.1016\/j.dam.2007.06.008","volume":"155","author":"B Bre\u0161ar","year":"2007","unstructured":"Bre\u0161ar, B., Klav\u017ear, S., Rall, D.F.: On the packing chromatic number of Cartesian products, hexagonal lattice, and trees. Discret. Appl. Math. 155, 2303\u20132311 (2007)","journal-title":"Discret. Appl. Math."},{"key":"1647_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/s10440-014-9870-7","volume":"134","author":"P Dorbec","year":"2014","unstructured":"Dorbec, P., Klav\u017ear, S.: Generalized power domination: propagation radius and Sierpi\u0144ski graphs. Acta Appl. Math. 134, 75\u201386 (2014)","journal-title":"Acta Appl. Math."},{"key":"1647_CR5","unstructured":"Ekstein, J., Fiala, J., Holub, P., Lidick\u00fd, B.: The packing chromatic number of the square lattice is at least 12. arXiv:1003.2291v1 . Submitted on 11 Mar 2010"},{"key":"1647_CR6","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.dam.2011.11.022","volume":"160","author":"J Ekstein","year":"2012","unstructured":"Ekstein, J., Holub, P., Lidick\u00fd, B.: Packing chromatic number of distance graphs. Discret. Appl. Math. 160, 518\u2013524 (2012)","journal-title":"Discret. Appl. Math."},{"key":"1647_CR7","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.dam.2013.10.036","volume":"167","author":"J Ekstein","year":"2014","unstructured":"Ekstein, J., Holub, P., Togni, O.: The packing coloring of distance graphs $$D(k, t)$$ D ( k , t ) . Discret. Appl. Math. 167, 100\u2013106 (2014)","journal-title":"Discret. Appl. Math."},{"key":"1647_CR8","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/j.dam.2008.09.001","volume":"158","author":"J Fiala","year":"2010","unstructured":"Fiala, J., Golovach, P.A.: Complexity of the packing coloring problem for trees. Discret. Appl. Math. 158, 771\u20137789 (2010)","journal-title":"Discret. Appl. Math."},{"key":"1647_CR9","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1016\/j.ejc.2008.09.014","volume":"30","author":"J Fiala","year":"2009","unstructured":"Fiala, J., Klav\u017ear, S., Lidick\u00fd, B.: The packing chromatic number of infinite product graphs. Eur. J. Combin. 30, 1101\u20131113 (2009)","journal-title":"Eur. J. Combin."},{"key":"1647_CR10","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.1016\/j.dam.2009.06.001","volume":"158","author":"AS Finbow","year":"2010","unstructured":"Finbow, A.S., Rall, D.F.: On the packing chromatic number of some lattices. Discret. Appl. Math. 158, 1224\u20131228 (2010)","journal-title":"Discret. Appl. Math."},{"key":"1647_CR11","first-page":"147","volume":"46","author":"H-Y Fu","year":"2010","unstructured":"Fu, H.-Y., Xie, D.: Equitable $$L(2,1)$$ L ( 2 , 1 ) -labelings of Sierpi\u0144ski graphs. Australas. J. Combin. 46, 147\u2013156 (2010)","journal-title":"Australas. J. Combin."},{"key":"1647_CR12","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1016\/j.disc.2015.01.028","volume":"338","author":"N Gastineau","year":"2015","unstructured":"Gastineau, N.: Dichotomies properties on computational complexity of S-packing coloring problems. Discret. Math. 338, 1029\u20131041 (2015)","journal-title":"Discret. Math."},{"key":"1647_CR13","unstructured":"Gastineau, N., Holub, P., Togni, O.: Packing chromatic number in outerplanar graphs with maximum degree $$3$$ 3 , abstract. In: Fifth International Conference on Combinatorics, Graph Theory and Applications, Elgersburg Technische Universit\u00e4t Ilmenau, March 16\u201320, 2015"},{"key":"1647_CR14","first-page":"33","volume":"86","author":"W Goddard","year":"2008","unstructured":"Goddard, W., Hedetniemi, S.M., Hedetniemi, S.T., Harris, J.M., Rall, D.F.: Broadcast chromatic numbers of graphs. Ars Combin. 86, 33\u201349 (2008)","journal-title":"Ars Combin."},{"key":"1647_CR15","doi-asserted-by":"crossref","first-page":"795","DOI":"10.7151\/dmgt.1642","volume":"34","author":"W Goddard","year":"2012","unstructured":"Goddard, W., Xu, H.: The S-packing chromatic number of a graph. Discuss. Math. Graph Theory 34, 795\u2013806 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"key":"1647_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10623-012-9642-1","volume":"69","author":"S Gravier","year":"2013","unstructured":"Gravier, S., Kov\u0161e, M., Mollard, M., Moncel, J., Parreau, A.: New results on variants of covering codes in Sierpi\u0144ski graphs. Des. Codes Cryptogr. 69, 181\u2013188 (2013)","journal-title":"Des. Codes Cryptogr."},{"key":"1647_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.dam.2014.05.049","volume":"177","author":"AM Hinz","year":"2014","unstructured":"Hinz, A.M., Heide, C.Holz auf der: An efficient algorithm to determine all shortest paths in Sierpi\u0144ski graphs. Discret. Appl. Math. 177, 111\u2013120 (2014)","journal-title":"Discret. Appl. Math."},{"key":"1647_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-0237-6","volume-title":"The Tower of Hanoi-Myths and Maths","author":"AM Hinz","year":"2013","unstructured":"Hinz, A.M., Klav\u017ear, S., Milutinovi\u0107, U., Petr, C.: The Tower of Hanoi-Myths and Maths. Birkh\u00e4user\/Springer, Basel (2013)"},{"key":"1647_CR19","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/s00373-011-1076-4","volume":"28","author":"AM Hinz","year":"2012","unstructured":"Hinz, A.M., Parisse, D.: The average eccentricity of Sierpi\u0144ski graphs. Graphs Combin. 28, 671\u2013686 (2012)","journal-title":"Graphs Combin."},{"key":"1647_CR20","first-page":"1344","volume":"11","author":"Y Jacobs","year":"2013","unstructured":"Jacobs, Y., Jonck, E., Joubert, E.J.: A lower bound for the packing chromatic number of the Cartesian product of cycles. Cent. Eur. J. Math. 11, 1344\u20131357 (2013)","journal-title":"Cent. Eur. J. Math."},{"issue":"122","key":"1647_CR21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1023\/A:1022444205860","volume":"47","author":"S Klav\u017ear","year":"1997","unstructured":"Klav\u017ear, S., Milutinovi\u0107, U.: Graphs $$S(n, k)$$ S ( n , k ) and a variant of the Tower of Hanoi problem. Czechoslov. Math. J. 47(122), 95\u2013104 (1997)","journal-title":"Czechoslov. Math. J."},{"key":"1647_CR22","doi-asserted-by":"crossref","first-page":"13","DOI":"10.26493\/1855-3974.255.88d","volume":"7","author":"D Kor\u017ee","year":"2014","unstructured":"Kor\u017ee, D., Vesel, A.: On the packing chromatic number of square and hexagonal lattice. Ars Math. Contemp. 7, 13\u201322 (2014)","journal-title":"Ars Math. Contemp."},{"key":"1647_CR23","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s00224-012-9423-2","volume":"53","author":"C-H Lin","year":"2013","unstructured":"Lin, C.-H., Liu, J.-J., Wang, Y.-L.: Global strong defensive alliances of Sierpi\u0144ski-like graphs. Theory Comput. Syst. 53, 365\u2013385 (2013)","journal-title":"Theory Comput. Syst."},{"key":"1647_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-85494-6","volume-title":"Fractals and Universal Spaces in Dimension Theory","author":"S Lipscomb","year":"2009","unstructured":"Lipscomb, S.: Fractals and Universal Spaces in Dimension Theory. Springer, Berlin (2009)"},{"key":"1647_CR25","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1137\/050628660","volume":"20","author":"D Romik","year":"2006","unstructured":"Romik, D.: Shortest paths in the Tower of Hanoi graph and finite automata. SIAM J. Discret. Math. 20, 610\u2013622 (2006)","journal-title":"SIAM J. Discret. Math."},{"key":"1647_CR26","doi-asserted-by":"crossref","first-page":"3588","DOI":"10.1016\/j.apm.2014.11.060","volume":"39","author":"Z Shao","year":"2015","unstructured":"Shao, Z., Vesel, A.: Modeling the packing coloring problem of graphs. Appl. Math. Model. 39, 3588\u20133595 (2015)","journal-title":"Appl. Math. Model."},{"key":"1647_CR27","doi-asserted-by":"crossref","unstructured":"Soukal, R., Holub, P.: A note on packing chromatic number of the square lattice. Electron. J. Combin. 17, (2010)","DOI":"10.37236\/466"},{"key":"1647_CR28","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/j.dam.2013.10.026","volume":"167","author":"O Togni","year":"2014","unstructured":"Togni, O.: On packing colorings of distance graphs. Discret. Appl. Math. 167, 280\u2013289 (2014)","journal-title":"Discret. Appl. Math."},{"key":"1647_CR29","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.dam.2015.04.006","volume":"190\u2013191","author":"P Torres","year":"2015","unstructured":"Torres, P., Valencia-Pabon, M.: The packing chromatic number of hypercubes. Discret. Appl. Math. 190\u2013191, 127\u2013140 (2015)","journal-title":"Discret. Appl. Math."},{"key":"1647_CR30","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s00373-013-1289-9","volume":"30","author":"B Xue","year":"2014","unstructured":"Xue, B., Zuo, L., Wang, G., Li, G.: The linear $$t$$ t -colorings of Sierpi\u0144ski-like graphs. Graphs Combin. 30, 755\u2013767 (2014)","journal-title":"Graphs Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1647-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1647-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1647-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,11]],"date-time":"2020-09-11T10:54:57Z","timestamp":1599821697000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1647-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,14]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["1647"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1647-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,14]]}}}