{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T22:12:04Z","timestamp":1765231924613},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T00:00:00Z","timestamp":1296000000000},"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,10]]},"DOI":"10.1007\/s10878-011-9386-2","type":"journal-article","created":{"date-parts":[[2011,1,25]],"date-time":"2011-01-25T11:32:34Z","timestamp":1295955154000},"page":"299-318","source":"Crossref","is-referenced-by-count":20,"title":["Some results on the injective chromatic number of\u00a0graphs"],"prefix":"10.1007","volume":"24","author":[{"given":"Min","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ge\u0148a","family":"Hahn","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Raspaud","sequence":"additional","affiliation":[]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,1,26]]},"reference":[{"key":"9386_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph theory with applications","author":"JA Bondy","year":"1976","unstructured":"Bondy JA, Murty USR (1976) Graph theory with applications. Macmillan, London"},{"key":"9386_CR2","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1016\/j.dam.2008.08.016","volume":"157","author":"Y Bu","year":"2009","unstructured":"Bu Y, Chen D, Raspaud A, Wang W (2009) Injective coloring of plane graphs. Discrete Appl Math 157:663\u2013672","journal-title":"Discrete Appl Math"},{"key":"9386_CR3","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1137\/S0895480193245339","volume":"9","author":"GJ Chang","year":"1996","unstructured":"Chang GJ, Kuo D (1996) The L(2,1)-labelling problem on graphs. SIAM J Discrete Math 9:309\u2013316","journal-title":"SIAM J Discrete Math"},{"key":"9386_CR4","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1016\/j.disc.2009.04.020","volume":"310","author":"A Doyon","year":"2010","unstructured":"Doyon A, Hahn G, Raspaud A (2010) Some bounds on the injective chromatic number of graphs. Discrete Math 310:585\u2013590","journal-title":"Discrete Math"},{"key":"9386_CR5","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0022-247X(65)90125-3","volume":"10","author":"RJ Duffin","year":"1965","unstructured":"Duffin RJ (1965) Topology of series-parallel networks. J Math Anal Appl 10:303\u2013318","journal-title":"J Math Anal Appl"},{"key":"9386_CR6","doi-asserted-by":"crossref","first-page":"1405","DOI":"10.1016\/j.disc.2007.07.075","volume":"308","author":"D Gon\u00e7alves","year":"2008","unstructured":"Gon\u00e7alves D (2008) On the L(p,1)-labelling of graphs. Discrete Math 308:1405\u20131414","journal-title":"Discrete Math"},{"key":"9386_CR7","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"JR Griggs","year":"1992","unstructured":"Griggs JR, Yeh RK (1992) Labelling graphs with a condition at distance 2. SIAM J Discrete Math 5:586\u2013595","journal-title":"SIAM J Discrete Math"},{"key":"9386_CR8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/S0012-365X(01)00466-6","volume":"256","author":"G Hahn","year":"2002","unstructured":"Hahn G, Kratochv\u00edl J, \u0160ir\u00e1\u0148 J, Sotteau D (2002) On the injective chromatic number of graphs. Discrete Math 256:179\u2013192","journal-title":"Discrete Math"},{"key":"9386_CR9","first-page":"621","volume-title":"Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms","author":"F Havet","year":"2008","unstructured":"Havet F, Reed B, Sereni JS (2008) L(2,1)-labelling of graphs. In: Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms. ACM, New York, pp 621\u2013630"},{"key":"9386_CR10","unstructured":"Kim SJ, Oum S (2009) Injective chromatic number and chromatic number of the square of graphs. Preprint"},{"key":"9386_CR11","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1137\/S0895480101399449","volume":"16","author":"D Kr\u00e1l","year":"2003","unstructured":"Kr\u00e1l D, \u0160krekovski R (2003) A theorem about the channel assignment problem. SIAM J Discrete Math 16:426\u2013437","journal-title":"SIAM J Discrete Math"},{"key":"9386_CR12","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/S0012-365X(03)00059-1","volume":"269","author":"KW Lih","year":"2003","unstructured":"Lih KW, Wang W, Zhu X (2003) Coloring the square of a K 4-minor free graph. Discrete Math 269:303\u2013309","journal-title":"Discrete Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9386-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9386-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9386-2","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-9386-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,26]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9386"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9386-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,26]]}}}