{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T09:10:42Z","timestamp":1775466642629,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,10,1]],"date-time":"1990-10-01T00:00:00Z","timestamp":654739200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8325,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[1990,10]]},"DOI":"10.1016\/0095-8956(90)90092-e","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"1-10","source":"Crossref","is-referenced-by-count":35,"title":["Unfriendly partitions of a graph"],"prefix":"10.1016","volume":"50","author":[{"given":"R","family":"Aharoni","sequence":"first","affiliation":[]},{"given":"E.C","family":"Milner","sequence":"additional","affiliation":[]},{"given":"K","family":"Prikry","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(90)90092-E_BIB1","series-title":"On a theorem about vertex coloring of graphs","author":"Bernardi","year":"1986"},{"key":"10.1016\/0095-8956(90)90092-E_BIB2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0095-8956(77)90037-5","article-title":"On an upper bound of a graph's chromatic number, depending on the graphs degree and density","volume":"23","author":"Borodin","year":"1977","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0095-8956(90)90092-E_BIB3","unstructured":"R. Cowan and W. Emerson, Proportional colorings of graphs, unpublished."},{"key":"10.1016\/0095-8956(90)90092-E_BIB4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.4153\/CJM-1949-031-1","article-title":"Axiomatic treatment of rank in infinite sets","volume":"1","author":"Rado","year":"1949","journal-title":"Canad. J. Math."},{"key":"10.1016\/0095-8956(90)90092-E_BIB5","unstructured":"I. Szalkai, Written communication."},{"key":"10.1016\/0095-8956(90)90092-E_BIB6","unstructured":"S. Shelah and E. C. Milner, Graphs with no unfriendly partitions, To appear in the volume to be published in 1989 by the Hungarian Academy of Sciences in honour of the 75th birthday of Paul Erd\u0151s."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090092E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009589569090092E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T15:52:22Z","timestamp":1548777142000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009589569090092E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,10]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,10]]}},"alternative-id":["009589569090092E"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(90)90092-e","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1990,10]]}}}