{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T08:35:29Z","timestamp":1772786129108,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,10,5]],"date-time":"2011-10-05T00:00:00Z","timestamp":1317772800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s10878-011-9409-z","type":"journal-article","created":{"date-parts":[[2011,10,4]],"date-time":"2011-10-04T21:06:47Z","timestamp":1317762407000},"page":"580-592","source":"Crossref","is-referenced-by-count":33,"title":["An optimal square coloring of planar graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Yuehua","family":"Bu","sequence":"first","affiliation":[]},{"given":"Xubo","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,10,5]]},"reference":[{"key":"9409_CR1","doi-asserted-by":"crossref","first-page":"6496","DOI":"10.1016\/j.disc.2009.06.029","volume":"309","author":"OV Borodin","year":"2009","unstructured":"Borodin OV, Ivanova AO (2009) 2-distance (\u0394+2)-coloring of planar graphs with girth six and \u0394\u226518. Discrete Math 309:6496\u20136502","journal-title":"Discrete Math"},{"key":"9409_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/j.disc.2010.10.008","volume":"311","author":"OV Borodin","year":"2011","unstructured":"Borodin OV, Ivanova AO (2011) List injective colorings of planar graphs. Discrete Math 311:154\u2013165","journal-title":"Discrete Math"},{"key":"9409_CR3","unstructured":"Borodin OV, Broersma HJ, Glebov A, van\u00a0den Heuvel J (2002) Stars and bunches in planar graphs. Part\u00a0II: General planar graphs and colourings. CDAM Researches Report"},{"key":"9409_CR4","first-page":"129","volume":"1","author":"OV Borodin","year":"2004","unstructured":"Borodin OV, Glebow AN, Ivanova AO, Neustroeva TK, Taskinow VA (2004) Sufficient conditions for planar graphs to be 2-distance (\u0394+1)-colorable. Sib Elektron Mat Izv 1:129\u2013141 (in Russian)","journal-title":"Sib Elektron Mat Izv"},{"key":"9409_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1002\/jgt.20273","volume":"57","author":"DW Cranston","year":"2008","unstructured":"Cranston DW, Kim SJ (2008) List-coloring the square of a subcubic graph. J Graph Theory 57:65\u201378","journal-title":"J Graph Theory"},{"key":"9409_CR6","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1016\/j.ejc.2007.11.005","volume":"29","author":"Z Dvo\u0155ak","year":"2008","unstructured":"Dvo\u0155ak Z, Kr\u00e1l D, Nejedl\u00fd P, \u0160krekovshi R (2008) Coloring squares of planar graphs with girth six. Eur J Comb 29:838\u2013849","journal-title":"Eur J Comb"},{"key":"9409_CR7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0166-218X(99)00249-8","volume":"103","author":"DS Kim","year":"2000","unstructured":"Kim DS, Du D-Z, Pardalos PM (2000) A coloring problem on the n-cube. Discrete Math 103:307\u2013311","journal-title":"Discrete Math"},{"key":"9409_CR8","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0012-365X(00)00371-X","volume":"240","author":"AV Kostochka","year":"2001","unstructured":"Kostochka AV, Woodall DR (2001) Choosablity conjectures and multicircuits. Discrete Math 240:123\u2013143","journal-title":"Discrete Math"},{"key":"9409_CR9","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jctb.2004.12.005","volume":"94","author":"M Molloy","year":"2005","unstructured":"Molloy M, Salavatipour MR (2005) A bound on the chromatic number of the square of a planar graph. J\u00a0Comb Theory, Ser B 94:189\u2013213","journal-title":"J\u00a0Comb Theory, Ser B"},{"key":"9409_CR10","unstructured":"Thomassen C (2006) The square of a planar cubic graph is 7-colorable. J.\u00a0Comb. Theory, B (submitted)"},{"key":"9409_CR11","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1002\/jgt.10077","volume":"42","author":"J Heuvel van\u00a0den","year":"2003","unstructured":"van\u00a0den Heuvel J, McGuinness S (2003) Coloring of the square of planar graph. J Graph Theory 42:110\u2013124","journal-title":"J Graph Theory"},{"key":"9409_CR12","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1009759916586","volume":"1","author":"PJ Wan","year":"1997","unstructured":"Wan PJ (1997) Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube networks. J Comb Optim 1:179\u2013186","journal-title":"J Comb Optim"},{"issue":"2","key":"9409_CR13","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1137\/S0895480101390448","volume":"17","author":"W Wang","year":"2003","unstructured":"Wang W, Lih KW (2003) Labeling planar graphs with conditions on girth and distance two. SIAM J Discrete Math 17(2):264\u2013275","journal-title":"SIAM J Discrete Math"},{"key":"9409_CR14","unstructured":"Wegner G (1977) Graphs with given diameter and a coloring problem. Technical Report. University of Dortmund, Germany"},{"key":"9409_CR15","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/S0304-3975(03)00394-3","volume":"310","author":"S Zhou","year":"2004","unstructured":"Zhou S (2004) A channel assignment problem for optical networks modelled by Cayley graphs. Theor Comput Sci 310:501\u2013511","journal-title":"Theor Comput Sci"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9409-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9409-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9409-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:15Z","timestamp":1559262195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9409-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,5]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9409"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9409-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,5]]}}}