乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T09:09:16Z","timestamp":1723108156618},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,4,20]],"date-time":"2018-04-20T00:00:00Z","timestamp":1524182400000},"content-version":"vor","delay-in-days":1480,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100004618","name":"Universit\u00e9 de Bourgogne","doi-asserted-by":"publisher","award":["BQR 036"],"id":[{"id":"10.13039\/501100004618","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001823","name":"Ministerstvo \u0160kolstv\u00ed, Ml\u00e1de\u017ee a T\u011blov\u00fdchovy","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001823","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1016\/j.dam.2013.10.036","type":"journal-article","created":{"date-parts":[[2013,11,15]],"date-time":"2013-11-15T14:45:21Z","timestamp":1384526721000},"page":"100-106","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":17,"special_numbering":"C","title":["The packing coloring of distance graphs D<\/mml:mi>(<\/mml:mo>k<\/mml:mi>,<\/mml:mo>t<\/mml:mi>)<\/mml:mo><\/mml:mrow><\/mml:math>"],"prefix":"10.1016","volume":"167","author":[{"given":"Jan","family":"Ekstein","sequence":"first","affiliation":[]},{"given":"P\u0159emysl","family":"Holub","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-9510-3595","authenticated-orcid":false,"given":"Olivier","family":"Togni","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2013.10.036_br000005","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/j.dam.2013.10.036_br000010","doi-asserted-by":"crossref","first-page":"2303","DOI":"10.1016\/j.dam.2007.06.008","article-title":"On the packing chromatic number of Cartesian products, hexagonal lattice and trees","volume":"155","author":"Bre\u0161ar","year":"2007","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2013.10.036_br000015","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1006\/eujc.1997.0199","article-title":"The circular chromatic numbers and the fractional chromatic numbers of distance graphs","volume":"19","author":"Chang","year":"1998","journal-title":"European J. Combin."},{"issue":"1","key":"10.1016\/j.dam.2013.10.036_br000020","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0095-8956(85)90039-5","article-title":"Colouring the real line","volume":"39","author":"Eggleton","year":"1985","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2013.10.036_br000025","unstructured":"J. Ekstein, J. Fiala, P. Holub, B. Lidick\u00fd, The packing chromatic number of the square lattice is at least 12, 2010. Preprint, arXiv: 1003.2291v1."},{"key":"10.1016\/j.dam.2013.10.036_br000030","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1016\/j.dam.2011.11.022","article-title":"Packing chromatic number of distance graphs","volume":"160","author":"Ekstein","year":"2012","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2013.10.036_br000035","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1016\/j.dam.2008.09.001","article-title":"Complexity of the packing chromatic problem for trees","volume":"158","author":"Fiala","year":"2010","journal-title":"Discrete Appl. Math."},{"issue":"5","key":"10.1016\/j.dam.2013.10.036_br000040","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1016\/j.ejc.2008.09.014","article-title":"The packing chromatic number of infinite product graphs","volume":"30","author":"Fiala","year":"2009","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2013.10.036_br000045","first-page":"33","article-title":"Broadcast chromatic numbers of graphs","volume":"86","author":"Goddard","year":"2008","journal-title":"Ars Combin."},{"key":"10.1016\/j.dam.2013.10.036_br000050","article-title":"A note on packing chromatic number of the square lattice","volume":"17","author":"Holub","year":"2010","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.dam.2013.10.036_br000055","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0012-365X(98)00099-5","article-title":"Coloring of integer distance graphs","volume":"191","author":"Kemnitz","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2013.10.036_br000060","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.disc.2005.02.004","article-title":"Circular chromatic numbers of some distance graphs","volume":"292","author":"Lin","year":"2005","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.dam.2013.10.036_br000065","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1006\/jctb.2001.2093","article-title":"Distance graphs with finite chromatic number","volume":"85","author":"Ruzsa","year":"2002","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2013.10.036_br000070","unstructured":"O. Togni, On packing colorings of distance graphs, 2010. Preprint."},{"issue":"1\u20133","key":"10.1016\/j.dam.2013.10.036_br000075","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0012-365X(02)00631-3","article-title":"The circular chromatic number of a class of distance graphs","volume":"265","author":"Zhu","year":"2003","journal-title":"Discrete Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X13004794?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X13004794?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T05:41:56Z","timestamp":1656222116000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X13004794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":15,"alternative-id":["S0166218X13004794"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2013.10.036","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2014,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The packing coloring of distance graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2013.10.036","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}