{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:13:45Z","timestamp":1725484425113},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438663"},{"type":"electronic","value":"9783540454717"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45471-3_25","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T17:18:22Z","timestamp":1179767902000},"page":"240-248","source":"Crossref","is-referenced-by-count":2,"title":["\u0394-List Vertex Coloring in Linear Time"],"prefix":"10.1007","author":[{"given":"San","family":"Skulrattanakulchai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"25_CR1","first-page":"125","volume":"XXVI","author":"P. Erd\u0151s","year":"1979","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West-Coast Conference on Combinatorics, Graph Theory and Computing. Volume XXVI of Congressus Numerantium., Arcata, California (1979) 125\u2013157","journal-title":"Proceedings of the West-Coast Conference on Combinatorics, Graph Theory and Computing"},{"key":"25_CR2","volume-title":"Graph Coloring Problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. John Wiley & Sons, Inc., New York, New York (1995)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.L. Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Proceedings of the Cambridge Philosophical Society. Mathematical and Physical Sciences 37 (1941) 194\u2013197","journal-title":"Proceedings of the Cambridge Philosophical Society. Mathematical and Physical Sciences"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/0095-8956(75)90089-1","volume":"19","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: Three short proofs in graph theory. Journal of Combinatorial Theory Series B 19 (1975) 269\u2013271","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"25_CR5","volume-title":"Combinatorial Problems and Exercises","author":"L. Lov\u00e1sz","year":"1993","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. Second edn. North-Holland Publishing Co., Amsterdam (1993)","edition":"Second edn."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1137\/0202012","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Tarjan, R.E.: Dividing a graph into triconnected components. SIAM Journal on Computing 2 (1973) 135\u2013158","journal-title":"SIAM Journal on Computing"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM Journal on Computing 1 (1972) 146\u2013160","journal-title":"SIAM Journal on Computing"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(00)00051-X","volume":"74","author":"H.N. Gabow","year":"2000","unstructured":"Gabow, H.N.: Path-based depth-first search for strong and bi-connected components. Information Processing Letters 74 (2000) 107\u2013114","journal-title":"Information Processing Letters"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1145\/234782.234783","volume":"27","author":"R. Greenlaw","year":"1995","unstructured":"Greenlaw, R., Petreschi, R.: Cubic graphs. ACM Computing Surveys 27 (1995) 471\u2013495","journal-title":"ACM Computing Surveys"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0020-0190(01)00221-6","volume":"81","author":"S. Skulrattanakulchai","year":"2002","unstructured":"Skulrattanakulchai, S.: 4-edge-coloring graphs of maximum degree 3 in linear time. Information Processing Letters 81 (2002) 191\u2013195","journal-title":"Information Processing Letters"},{"key":"25_CR11","unstructured":"Gabow, H.N., Skulrattanakulchai, S.: Coloring algorithms on subcubic graphs. (submitted)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B.:Modern Graph Theory. Springer-Verlag, New York (1998)","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"25_CR13","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. Second edn. McGraw-Hill, New York(2001)","edition":"Second edn."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45471-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T20:55:24Z","timestamp":1550350524000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45471-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438663","9783540454717"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45471-3_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}