{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:20:24Z","timestamp":1648930824592},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"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":3088,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1016\/j.ejc.2004.01.004","type":"journal-article","created":{"date-parts":[[2004,4,9]],"date-time":"2004-04-09T05:21:41Z","timestamp":1081488101000},"page":"251-257","source":"Crossref","is-referenced-by-count":1,"title":["Coloring the vertices of a graph with measurable sets in a probability space"],"prefix":"10.1016","volume":"26","author":[{"suffix":"Jr.","given":"P.D.","family":"Johnson","sequence":"first","affiliation":[]},{"given":"C.A.","family":"Rodger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2004.01.004_B1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0012-365X(01)00117-0","article-title":"Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs","volume":"241","author":"Daneshgar","year":"2001","journal-title":"Discrete Math"},{"key":"10.1016\/j.ejc.2004.01.004_B2","first-page":"195","article-title":"Hall\u2019s condition for multicolorings","volume":"128","author":"Hilton","year":"1997","journal-title":"Congr. Numer"},{"key":"10.1016\/j.ejc.2004.01.004_B3","first-page":"10","article-title":"More on the fractional chromatic number","volume":"9","author":"Johnson","year":"1999","journal-title":"Geombinatorics"},{"key":"10.1016\/j.ejc.2004.01.004_B4","series-title":"Real Analysis","author":"Royden","year":"1963"},{"key":"10.1016\/j.ejc.2004.01.004_B5","series-title":"Fractional Graph Theory","author":"Scheinerman","year":"1997"},{"key":"10.1016\/j.ejc.2004.01.004_B6","unstructured":"T. Slivnik, Extremal problems for cliques and coverings, Ph.D. Thesis, Department of Pure Mathematics and Mathematical Statistics, University of Cambridge, 1996"},{"key":"10.1016\/j.ejc.2004.01.004_B7","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1002\/jgt.3190160604","article-title":"Star chromatic numbers and products of graphs","volume":"16","author":"Zhu","year":"1992","journal-title":"J. Graph Theory"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669804000332?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669804000332?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,14]],"date-time":"2019-02-14T02:21:25Z","timestamp":1550110885000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669804000332"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["S0195669804000332"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2004.01.004","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}