{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T04:39:17Z","timestamp":1648615157935},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,6,3]],"date-time":"2014-06-03T00:00:00Z","timestamp":1401753600000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1444-y","type":"journal-article","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T11:04:05Z","timestamp":1401707045000},"page":"1795-1805","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Coloring the Square of Sierpi\u0144ski Graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Bing","family":"Xue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liancui","family":"Zuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,3]]},"reference":[{"key":"1444_CR1","doi-asserted-by":"crossref","unstructured":"Arett, D., Dor\u00e9e, S.: Coloring on the Tower of Hanoi graphs. Math. Mag. 83, 200\u2013209 (2010)","DOI":"10.4169\/002557010X494841"},{"key":"1444_CR2","first-page":"63","volume":"12","author":"L Beaudou","year":"2010","unstructured":"Beaudou, L., Gravier, S., Klav\u017ear, S., Kov\u0161e, M., Mollard, M.: Covering codes in Sierpi\u0144ski graphs. Discrete Math. Theor. Comput. Sci 12, 63\u201374 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci"},{"key":"1444_CR3","first-page":"113","volume":"139","author":"JP Bode","year":"1999","unstructured":"Bode, J.P., Hinz, A.M.: Results and open problems on the Tower of Hanoi. Congr. Numer. 139, 113\u2013122 (1999)","journal-title":"Congr. Numer."},{"key":"1444_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applicatons","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.: Graph Theory with Applicatons. North-Holland, New York (1976)"},{"key":"1444_CR5","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1080\/00207168908803728","volume":"28","author":"TH Chan","year":"1989","unstructured":"Chan, T.H.: A statistical analysis of the Towers of Hanoi problem. Int. J. Comput. Math. 28, 57\u201365 (1989)","journal-title":"Int. J. Comput. Math."},{"key":"1444_CR6","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.dam.2008.05.010","volume":"157","author":"JY Chen","year":"2009","unstructured":"Chen, J.Y., Lih, K.W., Wu, J.J.: Coloring the square of the Kneser graph KG(2k+1, k) and the Schrijver graph SG(2k+2, k). Discrete Appl. Math. 157, 170\u2013176 (2009)","journal-title":"Discrete Appl. Math."},{"key":"1444_CR7","doi-asserted-by":"crossref","first-page":"2867","DOI":"10.1016\/j.dam.2007.11.019","volume":"156","author":"SH Chiang","year":"2008","unstructured":"Chiang, S.H., Yan, J.H.: On $$L(d,1)$$ L ( d , 1 ) -labeling of Cartesian product a cycle and a path. Discrete Appl. Math. 156, 2867\u20132881 (2008)","journal-title":"Discrete Appl. Math."},{"key":"1444_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0012-365X(99)00070-9","volume":"208\u2013209","author":"P Cull","year":"1999","unstructured":"Cull, P., Nelson, I.: Error-correcting codes on the Towers of Hanoi graphs. Discrete Math. 208\u2013209, 157\u2013175 (1999)","journal-title":"Discrete Math."},{"issue":"4","key":"1444_CR9","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1016\/j.ejc.2007.11.005","volume":"29","author":"Z Dvo\u0159\u00e1k","year":"2008","unstructured":"Dvo\u0159\u00e1k, Z., Kr\u00e1l, D., Nejedl\u00fd, P., \u0160krekovski, R.: Coloring squares of planar graphs with girth six. Eur. J. Combin. 29(4), 838\u2013849 (2008)","journal-title":"Eur. J. Combin."},{"key":"1444_CR10","first-page":"147","volume":"46","author":"HY Fu","year":"2010","unstructured":"Fu, H.Y., Xie, D.Z.: 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":"1444_CR11","first-page":"513","volume":"105","author":"HY Fu","year":"2012","unstructured":"Fu, H.Y.: $$\\{P_r\\}$$ { P r } -free colorings of Sierpi\u0144ski-like graphs. Ars Combin. 105, 513\u2013524 (2012)","journal-title":"Ars Combin."},{"key":"1444_CR12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.11650\/twjm\/1500407890","volume":"9","author":"S Gravier","year":"2005","unstructured":"Gravier, S., Klav\u017ear, S., Mollard, M.: Codes and $$L(2,1)$$ L ( 2 , 1 ) -labelings in Sierpi\u0144ski-like graphs. Taiwan. J. Math. 9, 671\u2013681 (2005)","journal-title":"Taiwan. J. Math."},{"key":"1444_CR13","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.endm.2007.07.079","volume":"29","author":"F Havet","year":"2007","unstructured":"Havet, F., Van den Heuvel, J., Mcdiarmid, C., Reed, B.: List coloring of squares of planar graphs. Electron. Notes Discrete Math. 29, 515\u2013519 (2007)","journal-title":"Electron. Notes Discrete Math."},{"key":"1444_CR14","doi-asserted-by":"crossref","first-page":"538","DOI":"10.2307\/2324061","volume":"99","author":"AM Hinz","year":"1992","unstructured":"Hinz, A.M.: Pascal\u2019s triangle and the Tower of Hanoi. Am. Math. Mon. 99, 538\u2013544 (1992)","journal-title":"Am. Math. Mon."},{"key":"1444_CR15","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejc.2004.04.009","volume":"26","author":"AM Hinz","year":"2005","unstructured":"Hinz, A.M., Klav\u017ear, S., Milutinovi\u0107, U., Parisse, D., Petr, C.: Metric properties of the Tower of Hanoi graphs and Stern\u2019s diatomic sequence. Eur. J. Combin. 26, 693\u2013708 (2005)","journal-title":"Eur. J. Combin."},{"key":"1444_CR16","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1016\/j.disc.2011.08.019","volume":"312","author":"AM Hinz","year":"2012","unstructured":"Hinz, A.M., Parisse, D.: Coloring Hanoi and Sierpi\u0144ski graphs. Discrete Math. 312, 1521\u20131535 (2012)","journal-title":"Discrete Math."},{"key":"1444_CR17","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":"1444_CR18","unstructured":"Hinz, A.M.: The Tower of Hanoi. Enseign. Math. (2) 35, 289\u2013321 (1989)"},{"key":"1444_CR19","first-page":"277","volume-title":"Algebras and Combinatorics","author":"AM Hinz","year":"1999","unstructured":"Hinz, A.M.: The Tower of Hanoi. In: Shum, K.P., Taft, E.J., Wan, Z.X. (eds.) Algebras and Combinatorics, pp. 277\u2013289. Springer, Singapore (1999)"},{"key":"1444_CR20","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/S0723-0869(02)80023-8","volume":"20","author":"AM Hinz","year":"2002","unstructured":"Hinz, A.M., Parisse, D.: On the planarity of Hanoi graphs. Expo. Math. 20, 263\u2013268 (2002)","journal-title":"Expo. Math."},{"key":"1444_CR21","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":"1444_CR22","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1016\/j.disc.2008.02.026","volume":"309","author":"M Jakovac","year":"2009","unstructured":"Jakovac, M., Klav\u017ear, S.: Vertex-, edge-, and total-coloring of Sierpi\u0144ski-like graphs. Discrete Math. 309, 1548\u20131556 (2009)","journal-title":"Discrete Math."},{"issue":"122","key":"1444_CR23","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. Czechoslovak Math. J. 47(122), 95\u2013104 (1997)","journal-title":"Czechoslovak Math. J."},{"key":"1444_CR24","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1002\/jgt.20107","volume":"50","author":"S Klav\u017ear","year":"2005","unstructured":"Klav\u017ear, S., Mohar, B.: Crossing number of Sierpi\u0144ski-like graphs. J. Graph Theory 50, 186\u2013198 (2005)","journal-title":"J. Graph Theory"},{"key":"1444_CR25","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1017\/S0004972700040235","volume":"66","author":"S Klav\u017ear","year":"2002","unstructured":"Klav\u017ear, S., Milutinovi\u0107, U., Petr, C.: 1-perfect codes in Sierpi\u0144ski-like graphs. Bull. Aust. Math. Soc. 66, 369\u2013384 (2002)","journal-title":"Bull. Aust. Math. Soc."},{"key":"1444_CR26","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1016\/j.ejc.2012.09.006","volume":"34","author":"S Klav\u017ear","year":"2013","unstructured":"Klav\u017ear, S., Peterin, I., Zemlji\u010d, S.S.: Hamming dimension of a graph-The case of Sierpi\u0144ski graphs. Eur. J. Combin. 34, 460\u2013473 (2013)","journal-title":"Eur. J. Combin."},{"key":"1444_CR27","doi-asserted-by":"crossref","first-page":"72","DOI":"10.2298\/AADM130109001K","volume":"7","author":"S Klav\u017ear","year":"2013","unstructured":"Klav\u017ear, S., Zemlji\u010d, S.S.: On distances in Sierpi\u0144ski graphs: almost-extreme vertices and metric dimension. Appl. Anal. Discrete Math. 7, 72\u201382 (2013)","journal-title":"Appl. Anal. Discrete Math."},{"key":"1444_CR28","doi-asserted-by":"crossref","first-page":"1015","DOI":"10.11650\/twjm\/1500403890","volume":"10","author":"KW Lih","year":"2006","unstructured":"Lih, K.W., Wang, W.F.: Coloring the square of an outerplanar graph. Taiwan. J. Math. 10, 1015\u20131023 (2006)","journal-title":"Taiwan. J. Math."},{"key":"1444_CR29","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1007\/s00224-010-9286-3","volume":"49","author":"CH Lin","year":"2011","unstructured":"Lin, C.H., Liu, J.J., Wang, Y.L., Yen, W.C.: The hub number of Sierpi\u0144ski-like graphs. Theory Comput. Syst. 49, 588\u2013600 (2011)","journal-title":"Theory Comput. Syst."},{"key":"1444_CR30","first-page":"1157","volume":"115","author":"SL Lipscomb","year":"1992","unstructured":"Lipscomb, S.L., Perry, J.C.: Lipscomb\u2019s $$L(A)$$ L ( A ) space fractalized in Hilbert\u2019s $$l^2(A)$$ l 2 ( A ) space. Proc. Am. Math. Soc. 115, 1157\u20131165 (1992)","journal-title":"Proc. Am. Math. Soc."},{"key":"1444_CR31","doi-asserted-by":"crossref","first-page":"920","DOI":"10.2307\/2319405","volume":"80","author":"W Meyer","year":"1973","unstructured":"Meyer, W.: Equitable coloring. Am. Math. Mon. 80, 920\u2013922 (1973)","journal-title":"Am. Math. Mon."},{"issue":"47","key":"1444_CR32","first-page":"343","volume":"27","author":"U Milutinovi\u0107","year":"1992","unstructured":"Milutinovi\u0107, U.: Completeness of the Lipscomb space. Glas. Mat. Ser. III 27(47), 343\u2013364 (1992)","journal-title":"Glas. Mat. Ser. III"},{"key":"1444_CR33","doi-asserted-by":"crossref","unstructured":"Molloy, M., Salavatipour, M.R.: A bound on the chromatic number of the square of a planar graph. J. Combin. Theory Ser. B 94(2), 189\u2013213 (2005)","DOI":"10.1016\/j.jctb.2004.12.005"},{"key":"1444_CR34","first-page":"145","volume":"90","author":"D Parisse","year":"2009","unstructured":"Parisse, D.: On some metric properties of the Sierpi\u0144ski-like graphs $$S(n, k)$$ S ( n , k ) . Ars Combin. 90, 145\u2013160 (2009)","journal-title":"Ars Combin."},{"key":"1444_CR35","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. Discrete Math. 20, 610\u2013622 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"1444_CR36","doi-asserted-by":"crossref","first-page":"2327","DOI":"10.1016\/j.disc.2010.05.011","volume":"310","author":"\u00c9 Sopena","year":"2010","unstructured":"Sopena, \u00c9., Wu, J.J.: Coloring the square of Cartesian product of two cycles. Discrete. Math. 310, 2327\u20132333 (2010)","journal-title":"Discrete. Math."},{"key":"1444_CR37","doi-asserted-by":"crossref","unstructured":"Tucker, A.C.: Perfect graphs and an application to opimizing municipal services. SIAM Rev, 15, 585\u2013590 (1973)","DOI":"10.1137\/1015072"},{"key":"1444_CR38","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J Heuvel Van den","year":"2002","unstructured":"Van den Heuvel, J., Guinness, S.: Coloring the square of a planar graph. J. Graph Theory 42, 110\u2013124 (2002)","journal-title":"J. Graph Theory"},{"key":"1444_CR39","volume-title":"Graphs with given diameter and a coloring problem, Technical Report","author":"G Wegner","year":"1977","unstructured":"Wegner, G.: Graphs with given diameter and a coloring problem, Technical Report. Univ. Dortmund, Dortmund (1977)"},{"key":"1444_CR40","doi-asserted-by":"crossref","first-page":"1822","DOI":"10.1016\/j.dam.2012.03.022","volume":"160","author":"B Xue","year":"2012","unstructured":"Xue, B., Zuo, L., Li, G.J.: The hamiltonicity and path $$t$$ t -coloring of Sierpi\u0144ski-like graphs. Discrete Appl. Math. 160, 1822\u20131836 (2012)","journal-title":"Discrete Appl. Math."},{"key":"1444_CR41","doi-asserted-by":"crossref","unstructured":"Xue, B., Zuo, L., Wang, G., Li, G.J.: The linear $$t$$ t -colorings of Sierpi\u0144ski-like graphs. Graphs Combin. 30, 755\u2013767 (2014)","DOI":"10.1007\/s00373-013-1289-9"},{"key":"1444_CR42","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.dam.2013.08.029","volume":"162","author":"B Xue","year":"2014","unstructured":"Xue, B., Zuo, L., Wang, G., Li, G.J.: Shortest paths in Sierpi\u0144ski-like graphs. Discrete Appl. Math. 162, 314\u2013321 (2014)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1444-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1444-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1444-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T01:53:26Z","timestamp":1565488406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1444-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,3]]},"references-count":42,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1444"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1444-y","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,3]]}}}