{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T15:52:19Z","timestamp":1648569139806},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,5,31]],"date-time":"2014-05-31T00:00:00Z","timestamp":1401494400000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1445-x","type":"journal-article","created":{"date-parts":[[2014,5,30]],"date-time":"2014-05-30T10:27:31Z","timestamp":1401445651000},"page":"1397-1401","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Existence of Semi-colorings in a Graph"],"prefix":"10.1007","volume":"31","author":[{"given":"Michitaka","family":"Furuya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masaru","family":"Kamada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenta","family":"Ozeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,31]]},"reference":[{"key":"1445_CR1","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1002\/jgt.20593","volume":"69","author":"A Daniely","year":"2012","unstructured":"Daniely, A., Linial, N.: Tight products and graph expansion. J. Graph Theory 69, 426\u2013440 (2012)","journal-title":"J. Graph Theory"},{"key":"1445_CR2","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 4th edn. (Graduate Texts in Mathematics 173), Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"1445_CR3","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(90)90116-Y","volume":"80","author":"M Kano","year":"1990","unstructured":"Kano, M.: Sufficient conditions for a graph to have factors. Discrete Math. 80, 159\u2013165 (1990)","journal-title":"Discrete Math."},{"key":"1445_CR4","doi-asserted-by":"crossref","first-page":"1135","DOI":"10.1007\/s00373-012-1171-1","volume":"29","author":"B Wu","year":"2013","unstructured":"Wu, B., Deng, X., An, X., Yan, G.: A note on semi-coloring of graphs. Graphs Comb. 29, 1135\u20131140 (2013)","journal-title":"Graphs Comb."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1445-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1445-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1445-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:37Z","timestamp":1559055577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1445-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,31]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1445"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1445-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,31]]}}}