{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T06:20:19Z","timestamp":1769754019755,"version":"3.49.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":7137,"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,1]]},"DOI":"10.1016\/0012-365x(92)00058-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"155-162","source":"Crossref","is-referenced-by-count":52,"title":["Total colouring regular bipartite graphs is NP-hard"],"prefix":"10.1016","volume":"124","author":[{"given":"Colin J.H.","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abd\u00f3n","family":"S\u00e1nchez-Arroyo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)00058-Y_BIB1","series-title":"Doctoral Thesis","article-title":"Graphs and their chromatic numbers","author":"Behzad","year":"1965"},{"key":"10.1016\/0012-365X(92)00058-Y_BIB2","series-title":"Combinatorial Mathematics and its Applications","first-page":"1","article-title":"The total chromatic number of a graph: a survey","author":"Behzad","year":"1971"},{"key":"10.1016\/0012-365X(92)00058-Y_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0012-365X(92)00058-Y_BIB4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0095-8956(91)90085-X","article-title":"The total chromatic number of nearly complete bipartite graphs","volume":"B","author":"Hilton","year":"1991","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/0012-365X(92)00058-Y_BIB5","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-colourings","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(92)00058-Y_BIB6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","article-title":"NP-completeness of finding the chromatic index of regular graphs","volume":"4","author":"Leven","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0012-365X(92)00058-Y_BIB7","series-title":"M.Sc. Thesis","article-title":"Total colouring and complexity","author":"S\u00e1nchez-Arroyo","year":"1989"},{"key":"10.1016\/0012-365X(92)00058-Y_BIB8","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":"S\u00e1nchez-Arroyo","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)00058-Y_BIB9","first-page":"117","article-title":"Some unsolved problems in graph theory","volume":"23","author":"Vizing","year":"1968","journal-title":"Uspekhi Math. Nauk."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9200058Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9200058Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:27:59Z","timestamp":1555115279000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9200058Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0012365X9200058Y"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)00058-y","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}