{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T12:29:06Z","timestamp":1773145746559,"version":"3.50.1"},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"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":6986,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/0166-218x(94)90101-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"117-125","source":"Crossref","is-referenced-by-count":15,"title":["How to find overfull subgraphs in graphs with large maximum degree"],"prefix":"10.1016","volume":"51","author":[{"given":"Thomas","family":"Niessen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)90101-5_BIB1","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1137\/0114065","article-title":"A graph-theoretic approach to a communications problem","volume":"14","author":"Chartrand","year":"1966","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(94)90101-5_BIB2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1002\/jgt.3190080403","article-title":"The chromatic index of graphs of even order with many edges","volume":"8","author":"Chetwynd","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(94)90101-5_BIB3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0167-5060(08)70453-9","article-title":"The edge-chromatic class of graphs with maximum degree at least |V|\u22123","volume":"41","author":"Chetwynd","year":"1989","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/0166-218X(94)90101-5_BIB4","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(89)90082-4","article-title":"1-factorizing regular graphs of high degree \u2014 an improved bound","volume":"75","author":"Chetwynd","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)90101-5_BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0095-8956(90)90129-N","article-title":"The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small","volume":"48","author":"Chetwynd","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(94)90101-5_BIB6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0012-365X(89)90198-2","article-title":"Two conjectures on edge-colouring","volume":"74","author":"Hilton","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)90101-5_BIB7","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-colouring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(94)90101-5_BIB8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/jgt.3190140211","article-title":"Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree","volume":"14","author":"Niessen","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(94)90101-5_BIB9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/jgt.3190050103","article-title":"The chromatic class of graphs with a spanning star","volume":"5","author":"Plantholt","year":"1981","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/0166-218X(94)90101-5_BIB10","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1112\/plms\/s3-38.3.423","article-title":"On multicolourings of cubic graphs, and conjectures of Fulkerson and Tutte","volume":"38","author":"Seymour","year":"1979","journal-title":"Proc. London Math. Soc. Ser."},{"key":"10.1016\/0166-218X(94)90101-5_BIB11","first-page":"127","article-title":"Fractional edge colorings","volume":"21","author":"Stahl","year":"1979","journal-title":"Cahiers Centre \u00c9tudes Rech. Op\u00e9r."},{"key":"10.1016\/0166-218X(94)90101-5_BIB12","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Diskret. Analiz."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901015?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94901015?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:27:32Z","timestamp":1555136852000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94901015"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0166218X94901015"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)90101-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}