{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:24:32Z","timestamp":1759335872655},"reference-count":4,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T00:00:00Z","timestamp":1283299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s00493-010-2590-3","type":"journal-article","created":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T17:24:05Z","timestamp":1301073845000},"page":"521-532","source":"Crossref","is-referenced-by-count":7,"title":["Every rayless graph has an unfriendly partition"],"prefix":"10.1007","volume":"30","author":[{"given":"Henning","family":"Bruhn","sequence":"first","affiliation":[]},{"given":"Reinhard","family":"Diestel","sequence":"additional","affiliation":[]},{"given":"Agelos","family":"Georgakopoulos","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Spr\u00fcssel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,3,13]]},"reference":[{"key":"2590_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(90)90092-E","volume":"50","author":"R. Aharoni","year":"1990","unstructured":"R. Aharoni, E. C. Milner and K. Prikry: Unfriendly partitions of a graph, J. Combin. Theory (Series B) 50 (1990), 1\u201310.","journal-title":"J. Combin. Theory (Series B)"},{"key":"2590_CR2","doi-asserted-by":"crossref","unstructured":"R. Diestel: Graph Theory (4th edition), Springer-Verlag, 2010. Electronic edition available at: http:\/\/diestel-graph-theory.com .","DOI":"10.1007\/978-3-642-14279-6"},{"key":"2590_CR3","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01192782","volume":"40","author":"R. Schmidt","year":"1983","unstructured":"R. Schmidt: Ein Ordnungsbegriff f\u00fcr Graphen ohne unendliche Wege mit einer Anwendung auf n-fach zusammenh\u00e4ngende Graphen, Arch. Math. 40 (1983), 283\u2013288.","journal-title":"Arch. Math."},{"key":"2590_CR4","doi-asserted-by":"crossref","unstructured":"S. Shelah and E. C. Milner: Graphs with no unfriendly partitions, in: A tribute to Paul Erd\u0151s, pages 373\u2013384, Cambrigde Univ. Press, 1990.","DOI":"10.1017\/CBO9780511983917.031"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2590-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-010-2590-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-010-2590-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T08:53:12Z","timestamp":1560070392000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-010-2590-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["2590"],"URL":"https:\/\/doi.org\/10.1007\/s00493-010-2590-3","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}