{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:27:35Z","timestamp":1767338855895,"version":"3.44.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4307,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["98-01-00748"],"award-info":[{"award-number":["98-01-00748"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00358-9","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"23-28","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":19,"title":["Edge and total coloring of interval graphs"],"prefix":"10.1016","volume":"114","author":[{"given":"V.A.","family":"Bojarshinov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00358-9_BIB1","unstructured":"M. Behzad, The total chromatic number of a graph: a survey, Combinatorial Mathematics and its Applications, Proceedings of the Conference, Oxford, 1969, Academic Press, N.Y., 1971, pp. 1\u20139."},{"issue":"2","key":"10.1016\/S0166-218X(00)00358-9_BIB2","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0095-8956(89)90045-2","article-title":"On the \u0394-subgraph of graphs which are critical with respect to the chromatic index","volume":"46","author":"Chetwynd","year":"1989","journal-title":"J. Combin. Theory Ser. B"},{"year":"1977","series-title":"Edge-colourings of graphs","author":"Fiorini","key":"10.1016\/S0166-218X(00)00358-9_BIB3"},{"issue":"4","key":"10.1016\/S0166-218X(00)00358-9_BIB4","doi-asserted-by":"crossref","first-page":"713","DOI":"10.1137\/0210054","article-title":"The NP-completeness of some edge-partition problems","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0166-218X(00)00358-9_BIB5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0012-365X(77)90146-7","article-title":"The total coloring of a multigraph with maximal degree 4","volume":"17","author":"Kostochka","year":"1977","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/S0166-218X(00)00358-9_BIB6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0012-365X(95)00286-6","article-title":"The total chromatic number of any multigraph with maximum degree five is at most seven","volume":"162","author":"Kostochka","year":"1996","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00358-9_BIB7","unstructured":"T.-H. Ma, Algorithms on special classes of graphs and partially ordered sets, Ph.D. Thesis, Inst. of Inform. Sci., Republic of China, Nankang, Taipei, 1993."},{"key":"10.1016\/S0166-218X(00)00358-9_BIB8","unstructured":"T.-H. Ma, W.-L. Hsu, Fast and simple algorithms for recognizing chordal comparability graphs and interval orders. Internal Report. Inst. of Inform. Sci., Republic of China, Nankang, Taipei, 1991."},{"issue":"1","key":"10.1016\/S0166-218X(00)00358-9_BIB9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/jgt.3190050103","article-title":"The chromatic index of graphs with a spanning star","volume":"5","author":"Plantholt","year":"1981","journal-title":"J. Graph Theory"},{"issue":"1","key":"10.1016\/S0166-218X(00)00358-9_BIB10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0012-365X(83)90074-2","article-title":"The chromatic index of graphs with large maximum degree","volume":"47","author":"Plantholt","year":"1983","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/S0166-218X(00)00358-9_BIB11","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0012-365X(89)90187-8","article-title":"Determining the total colouring number is NP-hard","volume":"78","author":"Sanchez-Arroyo","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(00)00358-9_BIB12","unstructured":"V.G. Vizing, On evaluation of the chromatic number of a p-graph, Discrete Analysis, Collection of works of Sobolev Institute of mathematics SB RAS 3 (1964) 3\u201324 (in Russian)."},{"key":"10.1016\/S0166-218X(00)00358-9_BIB13","doi-asserted-by":"crossref","unstructured":"V.G. Vizing, Some unsolved problems of graph theory, Uspehi Mat. Nauk 23(6) (1968) 117\u2013134 (in Russian).","DOI":"10.1070\/RM1968v023n06ABEH001252"},{"key":"10.1016\/S0166-218X(00)00358-9_BIB14","series-title":"Total Colouring of Graphs","volume":"Vol. 1623","author":"Yap","year":"1996"},{"key":"10.1016\/S0166-218X(00)00358-9_BIB15","unstructured":"A.A. Zykov, Theory of Finite Graphs I, Nauka, Novosibirsk, 1969 (in Russian)."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003589?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00003589?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T11:57:00Z","timestamp":1759060620000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00003589"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00003589"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00358-9","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[2001,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Edge and total coloring of interval graphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0166-218X(00)00358-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}