{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:35:56Z","timestamp":1759638956953},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,2,21]],"date-time":"2013-02-21T00:00:00Z","timestamp":1361404800000},"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":[[2015,2]]},"DOI":"10.1007\/s10878-013-9599-7","type":"journal-article","created":{"date-parts":[[2013,2,20]],"date-time":"2013-02-20T03:32:40Z","timestamp":1361331160000},"page":"373-388","source":"Crossref","is-referenced-by-count":5,"title":["Two smaller upper bounds of list injective chromatic number"],"prefix":"10.1007","volume":"29","author":[{"given":"Yuehua","family":"Bu","sequence":"first","affiliation":[]},{"given":"Kai","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Sheng","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,2,21]]},"reference":[{"key":"9599_CR1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1134\/S0037446606010034","volume":"52","author":"OV Borodin","year":"2011","unstructured":"Borodin OV, Ivanova AO (2011) Injective $(\\Delta +1)$-coloring of planar graphs with girth 6. Siberian Math J 52:23\u201329","journal-title":"Siberian Math J"},{"key":"9599_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. Discret Math 311:154\u2013165","journal-title":"Discret Math"},{"key":"9599_CR3","unstructured":"Borodin OV, Ivanova AO, Neustroeva TK (2007) A prescribed 2-distance $(\\Delta +1)$-coloring of planar graphs with a given girth. Diskretn Anal Issled Oper Ser 1 14(3):13\u201330"},{"key":"9599_CR4","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 planar graphs. Discret Appl Math 157:663\u2013672","journal-title":"Discret Appl Math"},{"key":"9599_CR5","doi-asserted-by":"crossref","unstructured":"Bu Y, Lu K (2012) Injective colorings of planar graphs with girth 7. Discret Math. Algorithms Appl 4(2), 1250034, p. 8","DOI":"10.1142\/S1793830912500346"},{"key":"9599_CR6","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10878-011-9386-2","volume":"24","author":"M Chen","year":"2012","unstructured":"Chen M, Hahn G, Raspaud A, Wang W (2012) Some results on the injective chromatic number of graphs. J Comb Optim 24:299\u2013318","journal-title":"J Comb Optim"},{"key":"9599_CR7","doi-asserted-by":"crossref","first-page":"2965","DOI":"10.1016\/j.disc.2010.07.003","volume":"310","author":"DW Cranston","year":"2010","unstructured":"Cranston DW, Kim S-J, Yu G (2010) Injective colorings of sparse graphs. Discret Math 310:2965\u20132973","journal-title":"Discret Math"},{"key":"9599_CR8","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/s00453-010-9425-x","volume":"60","author":"DW Cranston","year":"2010","unstructured":"Cranston DW, Kim S-J, Yu G (2010) Injective colorings of graphs with low average degreee. Algorithmica 60:553\u2013568","journal-title":"Algorithmica"},{"key":"9599_CR9","unstructured":"Dimitrov D, Lu\u017ear B, \u0160krekovski R (2009) Injective coloring of planar graphs, manuscript. http:\/\/topology.nipissingu.ca\/graph2010\/abstracts\/abstract_DD_InjectiveColoring.pdf"},{"key":"9599_CR10","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 chromatics number of graphs. Discret Math 310:585\u2013590","journal-title":"Discret Math"},{"key":"9599_CR11","doi-asserted-by":"crossref","unstructured":"Dong A, Wang G (2012) Neighbor sum distinguishing coloring of some graphs. Discret Math. Algorithms Appl 4(4), 1250047, p. 12","DOI":"10.1142\/S1793830912500474"},{"key":"9599_CR12","doi-asserted-by":"crossref","unstructured":"Hahn G, Kratochv\u00edl J, \u0160ir\u00e1\u0148 J, Sotteau D (2002) On the injective chromatic number of graphs. Discret Math 256:179\u2013192","DOI":"10.1016\/S0012-365X(01)00466-6"},{"key":"9599_CR13","unstructured":"Hahn G, Raspaud A, Wang W (2006) On the injective coloring of $K_{4}$-minor free graphs, preprint"},{"key":"9599_CR14","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1016\/j.disc.2011.10.029","volume":"312","author":"R Li","year":"2012","unstructured":"Li R, Xu B (2012) Injective choosability of planar graphs of girth five and six. Discret Math 312:1260\u20131265","journal-title":"Discret Math"},{"key":"9599_CR15","first-page":"1110","volume":"48","author":"B Lu\u017ear","year":"2010","unstructured":"Lu\u017ear B (2010) Planar graphs with largest injective chromatic numbers. IMFM Preprint Series 48:1110","journal-title":"IMFM Preprint Series"},{"key":"9599_CR16","doi-asserted-by":"crossref","first-page":"5636","DOI":"10.1016\/j.disc.2008.04.005","volume":"309","author":"B Lu\u017ear","year":"2009","unstructured":"Lu\u017ear B, \u0160krekovski R, Tancer M (2009) Injective colorings of planar graphs with few colors. Discret Math 309:5636\u20135649","journal-title":"Discret Math"},{"key":"9599_CR17","doi-asserted-by":"crossref","unstructured":"Paul V, Germina KA (2012) On edge coloring of hypergraphs and Erd\u00f6s-Faber-Lov\u00e1sz conjecture. Discret Math, Algorithms Appl 4(1), 125003, p. 5","DOI":"10.1142\/S1793830912500036"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9599-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9599-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9599-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T01:38:16Z","timestamp":1644370696000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9599-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,21]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["9599"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9599-7","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,21]]}}}