{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T12:42:35Z","timestamp":1648644155165},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T00:00:00Z","timestamp":1495756800000},"content-version":"unspecified","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":[[2017,7]]},"DOI":"10.1007\/s00373-017-1804-5","type":"journal-article","created":{"date-parts":[[2017,5,26]],"date-time":"2017-05-26T16:49:38Z","timestamp":1495817378000},"page":"969-979","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Forbidden Properly Edge-Colored Subgraphs that Force Large Highly Connected Monochromatic Subgraphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Robert","family":"Kati\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colton","family":"Magnant","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pouria","family":"Salehi Nowbandegani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,26]]},"reference":[{"issue":"9","key":"1804_CR1","doi-asserted-by":"crossref","first-page":"1722","DOI":"10.1016\/j.disc.2006.01.030","volume":"308","author":"B Bollob\u00e1s","year":"2008","unstructured":"Bollob\u00e1s, B., Gy\u00e1rf\u00e1s, A.: Highly connected monochromatic subgraphs. Discrete Math. 308(9), 1722\u20131725 (2008)","journal-title":"Discrete Math."},{"key":"1804_CR2","doi-asserted-by":"crossref","unstructured":"Fujita, S., Magnant, C.: Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs. SIAM J. Discrete Math 27(3), 1625\u20131637 (2013)","DOI":"10.1137\/120896906"},{"key":"1804_CR3","doi-asserted-by":"crossref","unstructured":"Fujita, S., Magnant, C.: Note on highly connected monochromatic subgraphs in 2-colored complete graphs. Electron. J. Combin. 18(1):Paper 15, 5 (2011)","DOI":"10.37236\/502"},{"issue":"1","key":"1804_CR4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1002\/jgt.20365","volume":"61","author":"H Liu","year":"2009","unstructured":"Liu, H., Morris, R., Prince, N.: Highly connected monochromatic subgraphs of multicolored graphs. J. Graph Theory 61(1), 22\u201344 (2009)","journal-title":"J. Graph Theory"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-017-1804-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1804-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-017-1804-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T17:47:45Z","timestamp":1602179265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-017-1804-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,26]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,7]]}},"alternative-id":["1804"],"URL":"https:\/\/doi.org\/10.1007\/s00373-017-1804-5","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,5,26]]}}}