{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T01:47:43Z","timestamp":1783475263753,"version":"3.55.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":6072,"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":[[1996,12]]},"DOI":"10.1016\/0012-365x(95)00286-6","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"199-214","source":"Crossref","is-referenced-by-count":100,"title":["The total chromatic number of any multigraph with maximum degree five is at most seven"],"prefix":"10.1016","volume":"162","author":[{"given":"A.V.","family":"Kostochka","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(95)00286-6_BIB1","series-title":"Mathematics and its Applications","first-page":"1","article-title":"The total chromatic number of a graph: a survey","author":"Behzad","year":"1969"},{"key":"10.1016\/0012-365X(95)00286-6_BIB2","first-page":"3","article-title":"On partition of graphs into degenerate subgraphs","volume":"28","author":"Borodin","year":"1976","journal-title":"Methods of Discrete Analysis in the Theory of Graphs and Logical Functions"},{"key":"10.1016\/0012-365X(95)00286-6_BIB3","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(95)00286-6_BIB4","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1002\/jgt.3190160510","article-title":"Some upper bounds on the total and list chromatic numbers of multigraphs","volume":"16","author":"Chetwynd","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(95)00286-6_BIB5","article-title":"An improvement of Hind's upper bound on the total chromatic number","author":"Chetwynd","year":"1993"},{"key":"10.1016\/0012-365X(95)00286-6_BIB6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF01787726","article-title":"An upper bound for the total chromatic number","volume":"6","author":"Hind","year":"1990","journal-title":"Graphs Combin."},{"key":"10.1016\/0012-365X(95)00286-6_BIB7","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."},{"key":"10.1016\/0012-365X(95)00286-6_BIB8","first-page":"13","article-title":"An analog of the Shannon bound for total coloring","volume":"30","author":"Kostochka","year":"1977","journal-title":"Methods of Discrete Analysis in the Solution of Combinatorial Problems"},{"key":"10.1016\/0012-365X(95)00286-6_BIB9","article-title":"Upper bounds on chromatic functions of graphs","author":"Kostochka","year":"1978"},{"key":"10.1016\/0012-365X(95)00286-6_BIB10","first-page":"33","article-title":"Exact upper bound on the total chromatic number of multigraphs","volume":"vol. 5","author":"Kostochka","year":"1979"},{"key":"10.1016\/0012-365X(95)00286-6_BIB11","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1112\/jlms\/s2-9.3.459","article-title":"Critical point-arboritic graphs","volume":"9","author":"Kronk","year":"1975","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(95)00286-6_BIB12","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0012-365X(95)00286-6_BIB13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","article-title":"Die Theorie der regularen Graphen","volume":"15","author":"Petersen","year":"1891","journal-title":"Acta Math."},{"key":"10.1016\/0012-365X(95)00286-6_BIB14","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/BF02771690","article-title":"On the total coloring of certain graphs","volume":"9","author":"Rosenfeld","year":"1971","journal-title":"Israel J. Math."},{"key":"10.1016\/0012-365X(95)00286-6_BIB15","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1112\/jlms\/s2-3.3.405","article-title":"On total coloring of a graph","volume":"3","author":"Vijayaditya","year":"1971","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(95)00286-6_BIB16","first-page":"117","article-title":"Some unsolved problems in graph theory","volume":"23","author":"Vizing","year":"1968","journal-title":"Uspeki Mat. Nauk"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95002866?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X95002866?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:26:21Z","timestamp":1556115981000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X95002866"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["0012365X95002866"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(95)00286-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}