{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:43Z","timestamp":1759638403734},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,7]],"date-time":"2015-08-07T00:00:00Z","timestamp":1438905600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10878-015-9942-2","type":"journal-article","created":{"date-parts":[[2015,8,6]],"date-time":"2015-08-06T11:53:21Z","timestamp":1438862001000},"page":"156-164","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Coupon coloring of some special graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Yongtang","family":"Shi","sequence":"first","affiliation":[]},{"given":"Meiqin","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Yue","sequence":"additional","affiliation":[]},{"given":"Yan","family":"Zhao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,7]]},"reference":[{"key":"9942_CR1","unstructured":"Abbas W, Egerstedt M, Liu CH, Tomas R, Whalen P (2013) Deploying robots with two sensors in $$K_{1,6}$$ K 1 , 6 -free graphs, http:\/\/arxiv.org\/abs\/1308.5450"},{"key":"9942_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph theory, GTM 244","author":"JA Bondy","year":"2008","unstructured":"Bondy JA, Murty SR (2008) Graph theory, GTM 244. Springer, Berlin"},{"key":"9942_CR3","doi-asserted-by":"crossref","first-page":"1250034","DOI":"10.1142\/S1793830912500346","volume":"4","author":"Y Bu","year":"2012","unstructured":"Bu Y, Lu K (2012) Injective coloring of plane graphs with girth 7. Discrete Math Algorithms Appl 4:1250034","journal-title":"Discrete Math Algorithms Appl"},{"key":"9942_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 plane graphs. Discrete Appl Math 157:663\u2013672","journal-title":"Discrete Appl Math"},{"key":"9942_CR5","doi-asserted-by":"crossref","DOI":"10.1515\/9781400831470","volume-title":"Distributed control of robotic networks","author":"F Bullo","year":"2009","unstructured":"Bullo F, Cort\u00e9s J, Martinez S (2009) Distributed control of robotic networks. Princeton University Press, Princeton"},{"key":"9942_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":"9942_CR7","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/j.dam.2015.04.026","volume":"193","author":"B Chen","year":"2015","unstructured":"Chen B, Kim JH, Tait M, Verstraete J (2015) On coupon coloring of graphs. Discrete Appl Math 193:94\u2013101","journal-title":"Discrete Appl Math"},{"key":"9942_CR8","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 SJ, Yu G (2010) Injective coloring of spare graphs. Discrete Math 310:2965\u20132973","journal-title":"Discrete Math"},{"key":"9942_CR9","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/s00453-010-9425-x","volume":"60","author":"DW Cranston","year":"2011","unstructured":"Cranston DW, Kim SJ, Yu G (2011) Injective coloring of graphs with low average degree. Algotithmica 60:553\u2013568","journal-title":"Algotithmica"},{"key":"9942_CR10","volume-title":"Graph theory. GTM 173","author":"R Diestel","year":"2006","unstructured":"Diestel R (2006) Graph theory. GTM 173. Springer, Berlin"},{"key":"9942_CR11","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":"9942_CR12","first-page":"5C10","volume":"11","author":"P Erd\u00f6s","year":"1963","unstructured":"Erd\u00f6s P (1963) On a combinatorial problem I. Nordisk Mat Tidskr 11:5C10","journal-title":"Nordisk Mat Tidskr"},{"key":"9942_CR13","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, Sottean D (2002) On the injective chromatic number of graphs. Discrete Math 256:179\u2013192","journal-title":"Discrete Math"},{"key":"9942_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3119-0","volume-title":"Rainbow connections of graphs","author":"X Li","year":"2012","unstructured":"Li X, Sun Y (2012) Rainbow connections of graphs. Springer, New York"},{"key":"9942_CR15","doi-asserted-by":"crossref","unstructured":"Li X, Shi Y (2013a) Rainbow connection in $$3$$ 3 -connected graphs. Graphs Comb 29(5):1471\u20131475","DOI":"10.1007\/s00373-012-1204-9"},{"key":"9942_CR16","doi-asserted-by":"crossref","unstructured":"Li X, Shi Y (2013b) On the rainbow vertex-connection. Discuss Math Graph Theory 33(2):307\u2013313","DOI":"10.7151\/dmgt.1664"},{"key":"9942_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00373-012-1243-2","volume":"29","author":"X Li","year":"2013","unstructured":"Li X, Shi Y, Sun Y (2013) Rainbow connections of graphs-A survey. Graphs Comb 29:1\u201338","journal-title":"Graphs Comb"},{"key":"9942_CR18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.amc.2015.02.015","volume":"258","author":"S Li","year":"2015","unstructured":"Li S, Li X, Shi Y (2015) Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs. Appl Math Comput 258:155\u2013161","journal-title":"Appl Math Comput"},{"key":"9942_CR19","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 coloring of plane graphs with few colors. Discrete Math. 309:5636\u20135649","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-015-9942-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9942-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9942-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9942-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T01:06:29Z","timestamp":1653008789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9942-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,7]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9942"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9942-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,7]]}}}