{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T18:35:49Z","timestamp":1778956549022,"version":"3.51.4"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T00:00:00Z","timestamp":1549065600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T00:00:00Z","timestamp":1549065600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1500121"],"award-info":[{"award-number":["DMS-1500121"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005302","name":"University of Illinois at Urbana-Champaign","doi-asserted-by":"publisher","award":["Langan Scholar Fund"],"award-info":[{"award-number":["Langan Scholar Fund"]}],"id":[{"id":"10.13039\/100005302","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1600592"],"award-info":[{"award-number":["DMS-1600592"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["18-01-00353A"],"award-info":[{"award-number":["18-01-00353A"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["16-01-00499"],"award-info":[{"award-number":["16-01-00499"]}],"id":[{"id":"10.13039\/501100002261","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":[[2019,3]]},"DOI":"10.1007\/s00373-019-02016-3","type":"journal-article","created":{"date-parts":[[2019,2,2]],"date-time":"2019-02-02T09:35:11Z","timestamp":1549100111000},"page":"513-537","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Packing Chromatic Number of Subdivisions of Cubic Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"J\u00f3zsef","family":"Balogh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandr","family":"Kostochka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8995-959X","authenticated-orcid":false,"given":"Xujun","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,2,2]]},"reference":[{"key":"2016_CR1","doi-asserted-by":"publisher","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. Discrete Appl. Math. 164, 373\u2013382 (2014)","journal-title":"Discrete Appl. Math."},{"key":"2016_CR2","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/j.disc.2017.09.014","volume":"341","author":"J Balogh","year":"2018","unstructured":"Balogh, J., Kostochka, A., Liu, X.: Packing chromatic number of cubic graphs. Discrete Math. 341, 474\u2013483 (2018)","journal-title":"Discrete Math."},{"key":"2016_CR3","doi-asserted-by":"publisher","first-page":"2337","DOI":"10.1016\/j.disc.2018.05.004","volume":"341","author":"B Bre\u0161ar","year":"2018","unstructured":"Bre\u0161ar, B., Ferme, J.: An infinite family of subcubic graphs with unbounded packing chromatic number. Discrete Math. 341, 2337\u20132342 (2018)","journal-title":"Discrete Math."},{"key":"2016_CR4","first-page":"2302","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. Discrete Appl. Math. 155, 2302\u20132311 (2007)","journal-title":"Discrete Appl. Math."},{"key":"2016_CR5","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1007\/s00373-015-1647-x","volume":"32","author":"B Bre\u0161ar","year":"2016","unstructured":"Bre\u0161ar, B., Klav\u017ear, S., Rall, D.F.: Packing chromatic number of base-3 Sierpi\u0144ski graphs. Graphs Combin. 32, 1313\u20131327 (2016)","journal-title":"Graphs Combin."},{"key":"2016_CR6","doi-asserted-by":"publisher","first-page":"1110","DOI":"10.1016\/j.disc.2016.09.030","volume":"340","author":"B Bre\u0161ar","year":"2017","unstructured":"Bre\u0161ar, B., Klav\u017ear, S., Rall, D.F., Wash, K.: Packing chromatic number under local changes in a graph. Discrete Math. 340, 1110\u20131115 (2017)","journal-title":"Discrete Math."},{"key":"2016_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00010-016-0461-8","volume":"91","author":"B Bre\u0161ar","year":"2017","unstructured":"Bre\u0161ar, B., Klav\u017ear, S., Rall, D.F., Wash, K.: Packing chromatic number, (1,1,2,2)-colorings, and characterizing the Petersen graph. Aequationes Math. 91, 169\u2013184 (2017)","journal-title":"Aequationes Math."},{"key":"2016_CR8","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00010-017-0520-9","volume":"92","author":"B Bre\u0161ar","year":"2018","unstructured":"Bre\u0161ar, B., Klav\u017ear, S., Rall, D.F., Wash, K.: Packing chromatic number versus chromatic and clique number. Aequationes Math. 92, 497\u2013513 (2018)","journal-title":"Aequationes Math."},{"key":"2016_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.dam.2016.05.010","volume":"213","author":"J Czap","year":"2016","unstructured":"Czap, J., Jendrol\u2019, S.: Facial packing edge-coloring of plane graphs. Discrete Appl. Math. 213, 71\u201375 (2016)","journal-title":"Discrete Appl. Math."},{"key":"2016_CR10","doi-asserted-by":"publisher","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. Discrete Appl. Math. 158, 771\u2013778 (2010)","journal-title":"Discrete Appl. Math."},{"key":"2016_CR11","doi-asserted-by":"publisher","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":"2016_CR12","doi-asserted-by":"publisher","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. Discrete Math. 338, 1029\u20131041 (2015)","journal-title":"Discrete Math."},{"key":"2016_CR13","doi-asserted-by":"publisher","first-page":"2461","DOI":"10.1016\/j.disc.2016.04.017","volume":"339","author":"N Gastineau","year":"2016","unstructured":"Gastineau, N., Togni, O.: S-packing colorings of cubic graphs. Discrete Math. 339, 2461\u20132470 (2016)","journal-title":"Discrete Math."},{"key":"2016_CR14","unstructured":"Gastineau, N., Holub, P., Togni, O.: On packing chromatic number of subcubic outerplanar graphs. \n                    arXiv:1703.05023"},{"key":"2016_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.26493\/1855-3974.436.178","volume":"9","author":"N Gastineau","year":"2015","unstructured":"Gastineau, N., Kheddouci, H., Togni, O.: Subdivision into $$i$$-packing and $$S$$-packing chromatic number of some lattices. ARS Math. Contemp. 9, 331\u2013354 (2015)","journal-title":"ARS Math. Contemp."},{"key":"2016_CR16","doi-asserted-by":"publisher","first-page":"795","DOI":"10.7151\/dmgt.1642","volume":"32","author":"W Goddard","year":"2012","unstructured":"Goddard, W., Xu, H.: The S-packing chromatic number of a graph. Discuss. Math. Graph Theory 32, 795\u2013806 (2012)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2016_CR17","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.dam.2013.09.016","volume":"166","author":"W Goddard","year":"2014","unstructured":"Goddard, W., Xu, H.: A note on S-packing colorings of lattices. Discrete Appl. Math. 166, 255\u2013262 (2014)","journal-title":"Discrete Appl. Math."},{"key":"2016_CR18","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":"2016_CR19","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":"2016_CR20","first-page":"310","volume":"66","author":"D Laiche","year":"2016","unstructured":"Laiche, D., Bouchemakh, I., Sopena, \u00c9.: On the packing coloring of undirected and oriented generalized theta graphs. Australas. J. Combin. 66, 310\u2013329 (2016)","journal-title":"Australas. J. Combin."},{"key":"2016_CR21","doi-asserted-by":"publisher","first-page":"665","DOI":"10.7151\/dmgt.1963","volume":"37","author":"D Laiche","year":"2017","unstructured":"Laiche, D., Bouchemakh, I., Sopena, \u00c9.: Packing coloring of some undirected and oriented coronae graphs. Discuss. Math. Graph Theory 37, 665\u2013690 (2017)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2016_CR22","first-page":"309","volume":"29","author":"C Sloper","year":"2004","unstructured":"Sloper, C.: An eccentric coloring of trees. Australas. J. Combin. 29, 309\u2013321 (2004)","journal-title":"Australas. J. Combin."},{"key":"2016_CR23","doi-asserted-by":"publisher","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. Discrete Appl. Math. 190\u2013191, 127\u2013140 (2015)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02016-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02016-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02016-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T08:55:51Z","timestamp":1589446551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02016-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,2]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["2016"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02016-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,2]]},"assertion":[{"value":"7 March 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}