{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T05:22:56Z","timestamp":1772774576243,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0020-0190(01)00221-6","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T13:55:05Z","timestamp":1034603705000},"page":"191-195","source":"Crossref","is-referenced-by-count":8,"title":["4-edge-coloring graphs of maximum degree 3 in linear time"],"prefix":"10.1016","volume":"81","author":[{"given":"San","family":"Skulrattanakulchai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00221-6_BIB001","series-title":"Modern Graph Theory","author":"Bollob\u00e1s","year":"1998"},{"key":"10.1016\/S0020-0190(01)00221-6_BIB002","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1017\/S030500410002168X","article-title":"On colouring the nodes of a network","volume":"37","author":"Brooks","year":"1941","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S0020-0190(01)00221-6_BIB003","unstructured":"A. Ehrenfeucht, V. Faber, H.A. Kierstead, A new method of proving theorems on chromatic index, Los Alamos National Laboratory Preprint LA-UR-82-661, Los Alamos, NM, 1982"},{"key":"10.1016\/S0020-0190(01)00221-6_BIB004","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0020-0190(00)00051-X","article-title":"Path-based depth-first search for strong and bi-connected components","volume":"74","author":"Gabow","year":"2000","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(01)00221-6_BIB005","series-title":"Induction in Geometry","author":"Golovina","year":"1963"},{"key":"10.1016\/S0020-0190(01)00221-6_BIB006","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/234782.234783","article-title":"Cubic graphs","volume":"27, 4","author":"Greenlaw","year":"1995","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/S0020-0190(01)00221-6_BIB007","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","article-title":"The NP-completeness of edge-coloring","volume":"10","author":"Holyer","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00221-6_BIB008","series-title":"Graph Coloring Problems","author":"Jensen","year":"1995"},{"key":"10.1016\/S0020-0190(01)00221-6_BIB009","doi-asserted-by":"crossref","first-page":"52","DOI":"10.2307\/2313923","article-title":"A proof of 4-coloring the edges of a cubic graph","volume":"73","author":"Johnson","year":"1966","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/S0020-0190(01)00221-6_BIB010","series-title":"Graphs, Networks and Algorithms","author":"Jungnickel","year":"1999"},{"key":"10.1016\/S0020-0190(01)00221-6_BIB011","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/S0020-0190(01)00221-6_BIB012","series-title":"The Four-Color Problem, Assaults and Conquest","author":"Saaty","year":"1977"},{"issue":"2","key":"10.1016\/S0020-0190(01)00221-6_BIB013","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/S0020-0190(01)00221-6_BIB014","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/0202012","article-title":"Dividing a graph into triconnected components","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(01)00221-6_BIB015","first-page":"25","article-title":"On an estimate of the chromatic class of a p-graph","volume":"29","author":"Vizing","year":"1964","journal-title":"Metody Diskret. Analiz."},{"key":"10.1016\/S0020-0190(01)00221-6_BIB016","first-page":"1129","article-title":"A survey of snarks","volume":"2","author":"Watkin","year":"1991"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T01:50:31Z","timestamp":1556848231000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0020019001002216"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00221-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}