{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:45:37Z","timestamp":1648597537336},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"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":[[2004,1]]},"DOI":"10.1016\/s0012-365x(03)00107-9","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T22:47:46Z","timestamp":1056149266000},"page":"207-218","source":"Crossref","is-referenced-by-count":10,"title":["Edge coloring of graphs with small average degrees"],"prefix":"10.1016","volume":"275","author":[{"given":"Rong","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cun-Quan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00107-9_BIB1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0012-365X(76)90139-4","article-title":"On small graphs critical with respect to edge-colourings","volume":"16","author":"Beineke","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00107-9_BIB2","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1017\/S030500410005129X","article-title":"Some remarks on a paper by Vizing on critical graphs","volume":"77","author":"Fiorini","year":"1975","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S0012-365X(03)00107-9_BIB3","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0012-365X(98)00050-8","article-title":"Edge colorings of graphs embeddable in a surface of low genus","volume":"190","author":"Hind","year":"1998","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00107-9_BIB4","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0012-365X(74)90009-0","article-title":"On critical graphs with chromatic index 4","volume":"9","author":"Jacobsen","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00107-9_BIB5","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02986658","article-title":"On the size of edge-chromatic critical graphs","volume":"10","author":"Kayathri","year":"1994","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(03)00107-9_BIB6","first-page":"671","article-title":"The chromatic class and location of a graph on a closed surface","volume":"7","author":"Mel'nikov","year":"1970","journal-title":"Mat. Zametki"},{"issue":"2","key":"10.1016\/S0012-365X(03)00107-9_BIB7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1006\/jctb.2001.2047","article-title":"Planar graphs of maximum degree seven are class I","volume":"83","author":"Sanders","year":"2001","journal-title":"J. Combin. Theory Ser. B."},{"key":"10.1016\/S0012-365X(03)00107-9_BIB8","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"3","author":"Vizing","year":"1964","journal-title":"Metody Diskret. Analiz."},{"key":"10.1016\/S0012-365X(03)00107-9_BIB9","first-page":"9","article-title":"Critical graphs with given chromatic class","volume":"5","author":"Vizing","year":"1965","journal-title":"Metody Diskret. Analiz."},{"key":"10.1016\/S0012-365X(03)00107-9_BIB10","first-page":"117","article-title":"Some unsolved problems in graph theory","volume":"23","author":"Vizing","year":"1968","journal-title":"Uspekhi Mat. Nauk"},{"issue":"2","key":"10.1016\/S0012-365X(03)00107-9_BIB11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s003730070027","article-title":"Edge colorings of embedded graphs","volume":"16","author":"Yan","year":"2000","journal-title":"Graphs Combin."},{"key":"10.1016\/S0012-365X(03)00107-9_BIB12","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0012-365X(81)90227-2","article-title":"On graphs critical with respect to edge-colorings","volume":"37","author":"Yap","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00107-9_BIB13","article-title":"Some Topics in Graph Theory","volume":"Vol. 108","author":"Yap","year":"1986"},{"issue":"4","key":"10.1016\/S0012-365X(03)00107-9_BIB14","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/s003730070009","article-title":"Every planar graph with maximum degree 7 is of class 1","volume":"16","author":"Zhang","year":"2000","journal-title":"Graphs Combin."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001079?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001079?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T09:26:23Z","timestamp":1553073983000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0012365X03001079"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00107-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}