{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T15:52:14Z","timestamp":1654098734750},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Foundation"},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Science Foundation"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s00373-019-02102-6","type":"journal-article","created":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T17:03:49Z","timestamp":1570035829000},"page":"1585-1596","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On Rainbow-Cycle-Forbidding Edge Colorings of Finite Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Dean","family":"Hoffman","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3022-9036","authenticated-orcid":false,"given":"Paul","family":"Horn","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Johnson","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-5891-6001","authenticated-orcid":false,"given":"Andrew","family":"Owens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,1]]},"reference":[{"issue":"2","key":"2102_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.20429\/tag.2017.040202","volume":"4","author":"Peter Johnson","year":"2017","unstructured":"Johnson, P., Owens, A.: Edge colorings of complete multipartite graphs forbidding rainbow cycles. Theory Appl. Graphs 4(2), 9 (2017) (article 2)","journal-title":"Theory and Applications of Graphs"},{"key":"2102_CR2","first-page":"219","volume":"83","author":"A Gouge","year":"2010","unstructured":"Gouge, A., Hoffman, D., Johnson, P., Nunley, L., Paben, L.: Edge colorings of $$K_n$$ which forbid rainbow cycles. Utilitas Math. 83, 219\u2013232 (2010)","journal-title":"Utilitas Math."},{"issue":"1","key":"2102_CR3","first-page":"17","volume":"4","author":"P Johnson","year":"2017","unstructured":"Johnson, P., Zhang, C.: Edge colorings of $$K_{m, n}$$ with $$m+n-1$$ colors which forbid rainbow cycles. Theory Appl. Graphs 4(1), 17 (2017). Article 1","journal-title":"Theory Appl. Graphs"},{"key":"2102_CR4","doi-asserted-by":"publisher","unstructured":"Fujita, S., Magnant, C., Ozeki, K.: Rainbow generalizations of Ramsey Theory\u2014a dynamic survey. Theory Appl. Graphs (1), 1 (2014). \nhttps:\/\/doi.org\/10.20429\/tag2014.000101\n\n. \nhttp:\/\/digitalcommons.georgiasouthern.edu\/tag\/vol0\/iss1\/1\n\n(p. 38)","DOI":"10.20429\/tag2014.000101"},{"key":"2102_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1002\/jgt.20382","volume":"62","author":"S Jendrol\u2019","year":"2009","unstructured":"Jendrol\u2019, S., Mis\u0306kuf, J., Sot\u00e1k, R., S\u0306krabul\u2019\u00e1kov\u00e1, E.: Rainbow faces in edge-colored plane graphs. J. Graph Theory 62, 84\u201399 (2009)","journal-title":"J. Graph Theory"},{"issue":"8","key":"2102_CR6","doi-asserted-by":"publisher","first-page":"2495","DOI":"10.1002\/j.1538-7305.1971.tb02618.x","volume":"50","author":"RL Graham","year":"1971","unstructured":"Graham, R.L., Pollak, H.O.: On the addressing problem for loop switching. Bell Syst. Tech. J. 50(8), 2495\u20132519 (1971)","journal-title":"Bell Syst. Tech. J."},{"key":"2102_CR7","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.jctb.2015.03.001","volume":"113","author":"N Alon","year":"2015","unstructured":"Alon, N.: Bipartite decomposition of random graphs. J. Comb. Theory Ser. B 113, 220\u2013235 (2015)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2102_CR8","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/jgt.22010","volume":"84","author":"N Alon","year":"2017","unstructured":"Alon, N., Bohman, T., Huang, H.: More on the bipartite decomposition of random graphs. J. Graph Theory 84, 45\u201352 (2017)","journal-title":"J. Graph Theory"},{"issue":"1","key":"2102_CR9","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/140960888","volume":"30","author":"F Chung","year":"2016","unstructured":"Chung, F., Peng, X.: Decomposition of random graphs into complete bipartite graphs. SIAM J. Discrete Math. 30(1), 296\u2013310 (2016)","journal-title":"SIAM J. Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02102-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02102-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02102-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,29]],"date-time":"2020-09-29T23:39:13Z","timestamp":1601422753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02102-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,1]]},"references-count":9,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["2102"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02102-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,1]]},"assertion":[{"value":"21 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 August 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 October 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}