{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T15:41:39Z","timestamp":1767973299357,"version":"3.49.0"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,1,11]],"date-time":"2015-01-11T00:00:00Z","timestamp":1420934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00373-014-1503-4","type":"journal-article","created":{"date-parts":[[2015,1,10]],"date-time":"2015-01-10T07:37:43Z","timestamp":1420875463000},"page":"2159-2173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency"],"prefix":"10.1007","volume":"31","author":[{"given":"Aseem","family":"Dalal","sequence":"first","affiliation":[]},{"given":"C. A.","family":"Rodger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,1,11]]},"reference":[{"key":"1503_CR1","unstructured":"Behzad, M.: Graphs and their chromatic numbers. Doctoral Thesis, Michigan State University (1965)"},{"key":"1503_CR2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1112\/jlms\/s2-9.2.279","volume":"9","author":"J-C Bermond","year":"1974","unstructured":"Bermond, J.-C.: Nombre chromatique total du graphe $$r$$ r -parti complet (French). J. Lond. Math. Soc. 9, 279\u2013285 (1974)","journal-title":"J. Lond. Math. Soc."},{"key":"1503_CR3","first-page":"195","volume":"66","author":"AG Chetwynd","year":"1988","unstructured":"Chetwynd, A.G., Hilton, A.J.W.: Some refinements of the total chromatic number conjecture. Congr. Numer. 66, 195\u2013215 (1988)","journal-title":"Congr. Numer."},{"key":"1503_CR4","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1002\/jgt.3190160608","volume":"16","author":"KH Chew","year":"1992","unstructured":"Chew, K.H., Yap, H.P.: Total chromatic number of complete $$r$$ r -partite graphs. J. Graph Theory 16, 629\u2013634 (1992)","journal-title":"J. Graph Theory"},{"key":"1503_CR5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0082-0784(00)80201-5","volume":"28","author":"L Dong","year":"2000","unstructured":"Dong, L., Yap, H.P.: The total chromatic number of unbalanced complete $$r$$ r -partite graphs of even order. Bull. Inst. Comb. Appl 28, 107\u2013117 (2000)","journal-title":"Bull. Inst. Comb. Appl"},{"key":"1503_CR6","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/0095-8956(88)90046-9","volume":"44","author":"DG Hoffman","year":"1988","unstructured":"Hoffman, D.G., Rodger, C.A.: Class one graphs. J. Comb. Theory (B) 44, 372\u2013376 (1988)","journal-title":"J. Comb. Theory (B)"},{"key":"1503_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1002\/jgt.3190160207","volume":"16","author":"DG Hoffman","year":"1992","unstructured":"Hoffman, D.G., Rodger, C.A.: The chromatic index of complete multipartite graphs. J. Graph Theory 16, 159\u2013163 (1992)","journal-title":"J. Graph Theory"},{"key":"1503_CR8","first-page":"205","volume":"113","author":"DG Hoffman","year":"1996","unstructured":"Hoffman, D.G., Rodger, C.A.: The total chromatic number of complete multipartite graphs (Festschrift for C. St. J. A. Nash-Williams). Congr. Numer. 113, 205\u2013220 (1996)","journal-title":"Congr. Numer."},{"key":"1503_CR9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0012-365X(03)00281-4","volume":"279","author":"CD Leach","year":"2004","unstructured":"Leach, C.D., Rodger, C.A.: Hamilton decompositions of complete graphs with a 3-factor leave. Discret. Math. 279, 337\u2013344 (2004)","journal-title":"Discret. Math."},{"key":"1503_CR10","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF02579280","volume":"2","author":"AJW Hilton","year":"1982","unstructured":"Hilton, A.J.W.: Canonical edge-colourings of locally finite graphs. Combinatorica 2, 37\u201351 (1982)","journal-title":"Combinatorica"},{"key":"1503_CR11","first-page":"117","volume":"23","author":"VG Vizing","year":"1968","unstructured":"Vizing, V.G.: Some unsolved problems in graph theory. Uspehi Mat. Nauk (Russian) 23, 117\u2013134 (1968)","journal-title":"Uspehi Mat. Nauk (Russian)"},{"key":"1503_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1112\/blms\/21.2.159","volume":"21","author":"HP Yap","year":"1989","unstructured":"Yap, H.P.: Total colourings of graphs. Bull. Lond. Math. Soc. 21, 159\u2013163 (1989)","journal-title":"Bull. Lond. Math. Soc."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1503-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1503-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1503-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:39Z","timestamp":1559055579000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1503-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1,11]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["1503"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1503-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1,11]]}}}