{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:24:41Z","timestamp":1703136281055},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":12981,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1016\/0012-365x(78)90167-x","type":"journal-article","created":{"date-parts":[[2004,1,6]],"date-time":"2004-01-06T10:48:13Z","timestamp":1073386093000},"page":"1-6","source":"Crossref","is-referenced-by-count":14,"title":["Another bound on the chromatic number of a graph"],"prefix":"10.1016","volume":"24","author":[{"given":"Paul A.","family":"Catlin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90167-X_BIB1","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 graph's degree and density","volume":"23","author":"Borodin","year":"1977","journal-title":"J. Combinatorial Theory Ser. B"},{"key":"10.1016\/0012-365X(78)90167-X_BIB2","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","article-title":"On colouring the nodes of a network","volume":"27","author":"Brooks","year":"1941","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/0012-365X(78)90167-X_BIB3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0012-365X(78)90049-3","article-title":"A bound on the chromatic number of a graph","volume":"22","author":"Catlin","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(78)90167-X_BIB4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/jgt.3190020210","article-title":"Graph decompositions satisfying extremal degree constraints","volume":"2","author":"Catlin","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(78)90167-X_BIB5","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0012-365X(78)90147-4","article-title":"Covering the vertex set of a graph with sub-graphs of smaller degree","volume":"21","author":"Lawrence","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(78)90167-X_BIB6","first-page":"237","article-title":"On decomposition of graphs","volume":"1","author":"Lov\u00e1sz","year":"1966","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0012-365X(78)90167-X_BIB7","unstructured":"J. Mitchem. On the genus of graphs with Lick-White number k, preprint."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X7890167X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X7890167X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T19:27:58Z","timestamp":1550258878000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X7890167X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X7890167X"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90167-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}