{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:46:06Z","timestamp":1725493566128},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_42","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"506-517","source":"Crossref","is-referenced-by-count":4,"title":["Total Colorings of Degenerated Graphs"],"prefix":"10.1007","author":[{"given":"Shuji","family":"Isobe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takao","family":"Nishizeki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"issue":"2","key":"42_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"S. Arnborg and J. Lagergren, Easy problems for tree-decomposable graphs, J. Algorithms, 12(2), pp. 308\u2013340, 1991.","journal-title":"J. Algorithms"},{"issue":"4","key":"42_CR2","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"H. L. Bodlaender","year":"1990","unstructured":"H. L. Bodlaender, Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees, J. Algorithms, 11(4), pp. 631\u2013643, 1990.","journal-title":"J. Algorithms"},{"issue":"B","key":"42_CR3","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1006\/jctb.1997.1780","volume":"71","author":"O. V. Borodin","year":"1997","unstructured":"O. V. Borodin, A. V. Kostochka and D. R. Woodall, List edge and list total colourings of multigraphs, J. Combinatorial Theory, Series B, 71, pp. 184\u2013204, 1997.","journal-title":"J. Combinatorial Theory"},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/BF01758777","volume":"7","author":"R. B. Borie","year":"1992","unstructured":"R. B. Borie, R. G. Parker and C. A. Tovey, Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families, Algorithmica, 7, pp. 555\u2013581, 1992.","journal-title":"Algorithmica"},{"key":"42_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s004930170002","volume":"21","author":"R. Cole","year":"2001","unstructured":"R. Cole, K. Ost and S. Schirra, Edge-coloring bipartite multigraphs in O(E logD) time, Combinatorica, 21, pp. 5\u201312, 2001.","journal-title":"Combinatorica"},{"key":"42_CR6","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"R. Diestel, Graph Theory, Springer, New York, 1997."},{"issue":"2","key":"42_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1142\/S0129054199000137","volume":"10","author":"S. Isobe","year":"1999","unstructured":"S. Isobe, X. Zhou and T. Nishizeki, A polynomial-time algorithm for finding total colorings of partial k-trees, Int. J. Found. Comput. Sci., 10(2), pp. 171\u2013194, 1999.","journal-title":"Int. J. Found. Comput. Sci."},{"key":"42_CR8","volume-title":"Graph Coloring Problems","author":"T. R. Jensen","year":"1995","unstructured":"T. R. Jensen and B. Toft, Graph Coloring Problems, John Wiley & Sons, New York, 1995."},{"key":"42_CR9","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/2402.322385","volume":"30","author":"D. Matula","year":"1983","unstructured":"D. Matula and L. Beck, Smallest-last ordering and clustering and graph coloring algorithms, J. Assoc. Comput. Mach., 30, pp. 417\u2013427, 1983.","journal-title":"J. Assoc. Comput. Mach."},{"key":"42_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70540-5","volume-title":"Planar Graphs: Theory and Algorithms","author":"T. Nishizeki","year":"1988","unstructured":"T. Nishizeki and N. Chiba, Planar Graphs: Theory and Algorithms, North-Holland, Amsterdam, 1988."},{"key":"42_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0012-365X(89)90187-8","volume":"78","author":"A. S\u00e1nchez-Arroyo","year":"1989","unstructured":"A. S\u00e1nchez-Arroyo. Determining the total colouring number is NP-hard, Discrete Math., 78, pp. 315\u2013319, 1989.","journal-title":"Discrete Math."},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0021-9800(68)80081-X","volume":"4","author":"G. Szekeres","year":"1968","unstructured":"G. Szekeres and H. Wilf, An inequality for the chromatic number of a graph, J. Combinatorial Theory, 4, pp. 1\u20133, 1968.","journal-title":"J. Combinatorial Theory"},{"key":"42_CR13","first-page":"9","volume":"5","author":"V. G. Vizing","year":"1965","unstructured":"V. G. Vizing, Critical graphs with given chromatic class (in Russian), Metody Discret Analiz., 5, pp. 9\u201317, 1965.","journal-title":"Metody Discret Analiz."},{"key":"42_CR14","series-title":"Lect. Notes in Math.","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0092895","volume-title":"Total Colourings of Graphs","author":"H. P. Yap","year":"1996","unstructured":"H. P. Yap, Total Colourings of Graphs, Lect. Notes in Math., 1623, Springer, Berlin, 1996."},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1006\/jagm.1996.0061","volume":"21","author":"X. Zhou","year":"1996","unstructured":"X. Zhou, S. Nakano and T. Nishizeki, Edge-coloring partial k-trees, J. Algorithms, 21, pp. 598\u2013617, 1996.","journal-title":"J. Algorithms"},{"issue":"1","key":"42_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00012","volume":"3","author":"X. Zhou","year":"1999","unstructured":"X. Zhou and T. Nishizeki, Edge-coloring and f-coloring for various classes of graphs, J. Graph Algorithms and Applications, \n                    http:\/\/www.cs.brown.edu\/publications\/jgaa\/\n                    \n                  , 3(1), pp. 1\u201318, 1999.","journal-title":"J. Graph Algorithms and Applications"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T18:27:41Z","timestamp":1551032861000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_42","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}