{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:47:48Z","timestamp":1725493668090},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405344"},{"type":"electronic","value":"9783540450719"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45071-8_19","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T04:04:43Z","timestamp":1193457883000},"page":"172-181","source":"Crossref","is-referenced-by-count":1,"title":["List Total Colorings of Series-Parallel Graphs"],"prefix":"10.1007","author":[{"given":"Xiao","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuki","family":"Matsuo","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":[[2003,6,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","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 colorings of multigraphs, J. Combinatorial Theory, Series B, 71, pp. 184\u2013204, 1997.","journal-title":"J. Combinatorial Theory, Series B"},{"key":"19_CR2","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990."},{"key":"19_CR3","volume-title":"Graph Theory","author":"R. Diestel","year":"1997","unstructured":"R. Diestel, Graph Theory, Springer-verlag, New York, 1997."},{"issue":"5","key":"19_CR4","first-page":"191","volume":"E86-A","author":"T. Fujino","year":"2003","unstructured":"T. Fujino, X. Zhou and T. Nishizeki, List edge-colorings of series-parallel graphs, IEICE Trans. on Fundamentals, E86-A,5, pp. 191\u2013203, 2003.","journal-title":"IEICE Trans. on Fundamentals"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"S. Isobe, X. Zhou and T. Nishizeki, Total colorings of degenerated graphs, Proc. of ICALP 2001, Lect. Notes in Computer Science, Springer, 2076, pp. 506\u2013517, 2001.","DOI":"10.1007\/3-540-48224-5_42"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K. Jansen","year":"1997","unstructured":"K. Jansen and P. Scheffler, Generalized coloring for tree-like graphs, Discrete Applied Math., 75, pp. 135\u2013155, 1997.","journal-title":"Discrete Applied Math."},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1474","volume":"6","author":"M. Juvan","year":"1999","unstructured":"M. Juvan, B. Mohar and R. Thomas, List edge-coloring of series-parallel graphs, The Electronic Journal of Combinatorics, 6, pp. 1\u20136, 1999.","journal-title":"The Electronic Journal of Combinatorics"},{"key":"19_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":"19_CR9","unstructured":"M. Kubale, Introduction to Computational Complexity and Algorithmic Graph Coloring, Gda\u0144skie Towarzystwo Naukowe, Gda\u0144sk, Poland, 1998."},{"key":"19_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, Amsterdm, 1988."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0166-218X(01)00223-2","volume":"115","author":"T. Nishizeki","year":"2001","unstructured":"T. Nishizeki, J. Vygen and X. Zhou, The edge-disjoint paths problem is NPcomplete for series-parallel graphs, Discrete Applied Math., 115, pp. 177\u2013186, 2001.","journal-title":"Discrete Applied Math."},{"key":"19_CR12","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":"19_CR13","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-verlag, Berlin, 1996."},{"issue":"2","key":"19_CR14","first-page":"144","volume":"35","author":"J. L. Wu","year":"2000","unstructured":"J. L. Wu, List edge-coloring of series-parallel graphs, Shandong Daxue Xuebao Kexue Ban, 35,2, pp. 144\u2013149, 2000 (in Chinese).","journal-title":"Shandong Daxue Xuebao Kexue Ban"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45071-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T13:10:48Z","timestamp":1587993048000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45071-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405344","9783540450719"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45071-8_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}