{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:20:33Z","timestamp":1783034433866,"version":"3.54.6"},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"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":12282,"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":[[1979,12]]},"DOI":"10.1016\/0095-8956(79)90021-2","type":"journal-article","created":{"date-parts":[[2005,2,9]],"date-time":"2005-02-09T14:37:08Z","timestamp":1107959828000},"page":"320-331","source":"Crossref","is-referenced-by-count":243,"title":["The book thickness of a graph"],"prefix":"10.1016","volume":"27","author":[{"given":"Frank","family":"Bernhart","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul C","family":"Kainen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0095-8956(79)90021-2_BIB1","author":"Harary","year":"1969"},{"key":"10.1016\/0095-8956(79)90021-2_BIB2","series-title":"Proceedings, 4th S.E. Conference on Combinatorics, Graph Theory, and Computing","first-page":"459","article-title":"On the book thicknesses of various graphs","author":"Ollmann","year":"1973"},{"key":"10.1016\/0095-8956(79)90021-2_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0021-9800(68)80081-X","article-title":"An inequality for the chromatic number of a graph","volume":"4","author":"Szekeres","year":"1968","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0095-8956(79)90021-2_BIB4","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1215\/ijm\/1256049011","article-title":"Every planar map is four colorable, I and II","volume":"21","author":"Haken","year":"1977","journal-title":"Ill. J. of Math."},{"key":"10.1016\/0095-8956(79)90021-2_BIB5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01707988","article-title":"A numerical equivalent of the four color map problem","volume":"45","author":"Whitney","year":"1937","journal-title":"Monat. Math. Phys."},{"key":"10.1016\/0095-8956(79)90021-2_BIB6","first-page":"79","article-title":"Graphs critical for maximum bookthickness","volume":"6","author":"Keys","year":"1975","journal-title":"Pi Mu Epsilon J."}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895679900212?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0095895679900212?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T18:08:56Z","timestamp":1586110136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0095895679900212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["0095895679900212"],"URL":"https:\/\/doi.org\/10.1016\/0095-8956(79)90021-2","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}