{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T06:32:45Z","timestamp":1723789965444},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,4,1]],"date-time":"1994-04-01T00:00:00Z","timestamp":765158400000},"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":7047,"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":[[1994,4]]},"DOI":"10.1016\/0012-365x(94)90101-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"21-33","source":"Crossref","is-referenced-by-count":21,"title":["Simultaneous coloring of edges and faces of plane graphs"],"prefix":"10.1016","volume":"128","author":[{"given":"Oleg V.","family":"Borodin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(94)90101-5_BIB1","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1090\/S0002-9904-1976-14122-5","article-title":"Every planar map is four colorable","volume":"82","author":"Appel","year":"1976","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/0012-365X(94)90101-5_BIB2","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1112\/jlms\/s1-42.1.226","article-title":"The colour numbers of complete graphs","volume":"42","author":"Behzad","year":"1967","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(94)90101-5_BIB3","first-page":"12","article-title":"Solution of Ringel's problems of the face and vertex coloring of plane graphs and coloring of 1-planar graphs","volume":"41","author":"Borodin","year":"1984","journal-title":"Metody Diskret. Analiza"},{"key":"10.1016\/0012-365X(94)90101-5_BIB4","first-page":"21","article-title":"Consistent colorings of graphs on the sphere","volume":"45","author":"Borodin","year":"1987","journal-title":"Metody Diskret. Analiza"},{"key":"10.1016\/0012-365X(94)90101-5_BIB5","first-page":"180","article-title":"On the total coloring of planar graphs","volume":"394","author":"Borodin","year":"1989","journal-title":"J. reine angew. Math."},{"key":"10.1016\/0012-365X(94)90101-5_BIB6","series-title":"Graph Theory and Comput.","first-page":"125","article-title":"Choosability in graphs","author":"Erd\u0151s","year":"1979"},{"key":"10.1016\/0012-365X(94)90101-5_BIB7","first-page":"9","article-title":"Simultaneous colouring of 4-valent maps","volume":"21","author":"Fiamchik","year":"1971","journal-title":"Mat. \u010cas."},{"key":"10.1016\/0012-365X(94)90101-5_BIB8","first-page":"225","article-title":"On a problem in map colouring","volume":"19","author":"Jucovi\u010d","year":"1969","journal-title":"Mat. \u010cas."},{"key":"10.1016\/0012-365X(94)90101-5_BIB9","first-page":"33","article-title":"Exact upper bound for the total chromatic number of multigraphs","author":"Kostochka","year":"1979","journal-title":"24th Int Wiss. Koll. TH Ilmenau"},{"key":"10.1016\/0012-365X(94)90101-5_BIB10","first-page":"101","article-title":"Contribution to the theory of Eulerian polyhedra","volume":"5","author":"Kotzig","year":"1955","journal-title":"Mat. \u010cas."},{"key":"10.1016\/0012-365X(94)90101-5_BIB11","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(73)90142-8","article-title":"A seven-color theorem on the sphere","volume":"5","author":"Kronk","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(94)90101-5_BIB12","series-title":"Proc. Int. Symp. Prague, 1974","article-title":"Recent advances in graph theory","year":"1975"},{"key":"10.1016\/0012-365X(94)90101-5_BIB13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF02996313","article-title":"Ein Sechsfarbenproblem auf der Kugel","volume":"29","author":"Ringel","year":"1965","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0012-365X(94)90101-5_BIB14","first-page":"25","article-title":"On the bound for the chromatic number of p-graphs","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskret. Analiz"},{"key":"10.1016\/0012-365X(94)90101-5_BIB15","first-page":"117","article-title":"Some open problems in graph theory","volume":"23","author":"Vizing","year":"1968","journal-title":"Uspehi Mat. Nauk."},{"key":"10.1016\/0012-365X(94)90101-5_BIB16","first-page":"3","article-title":"Coloring the vertices of a graph with assigned colors","volume":"29","author":"Vizing","year":"1976","journal-title":"Metody Diskret. Analiza"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X94901015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:58:33Z","timestamp":1555135113000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X94901015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,4]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,4]]}},"alternative-id":["0012365X94901015"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(94)90101-5","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,4]]}}}