{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:48:44Z","timestamp":1775580524500,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540204527","type":"print"},{"value":"9783540398905","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_32","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T01:16:57Z","timestamp":1283563017000},"page":"370-382","source":"Crossref","is-referenced-by-count":11,"title":["Coloring Powers of Graphs of Bounded Clique-Width"],"prefix":"10.1007","author":[{"given":"Ioan","family":"Todinca","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Bodlaender, H., Kratsch, D.: Private communication (2002)"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Olariu, S.: Upper bounds to the clique-width of graphs. Discrete Applied Mathematics\u00a0101, 77\u2013114 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Espelage, W., Gurski, F., Wanke, E.: How to solve NP-hard graph problems on clique-width bounded graphs in polynomial time. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 117\u2013128. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-45477-2_12"},{"key":"32_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completness. Freeman, New York (1979)"},{"key":"32_CR5","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/0405048","volume":"5","author":"J.R. Grigs","year":"1992","unstructured":"Grigs, J.R., Yeh, R.K.: Labelling graphs with a condition at distance 2. SIAM J. on Discrete Math.\u00a05, 586\u2013595 (1992)","journal-title":"SIAM J. on Discrete Math."},{"key":"32_CR6","unstructured":"Kobler, D., Rotics, U.: Polynomial algorithms for partitioning problems on graphs with fixed clique-width (extended abstract). In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms (SODA 2001), pp. 468\u2013476 (2001)"},{"key":"32_CR7","unstructured":"Todinca, I.: Coloring powers of graphs of bounded clique-width. Research Report RR-2002-10, LIFO \u2013 Universit\u00e9 d\u2019Orl\u00e9ans (2002), \n                    \n                      http:\/\/www.univorleans.fr\/SCIENCES\/LIFO\/prodsci\/rapports\/RR\/RR2002\/RR-2002-10.ps.gz"},{"issue":"4","key":"32_CR8","first-page":"671","volume":"E83-A","author":"X. Zhou","year":"2000","unstructured":"Zhou, X., Kanari, Y., Nishizeki, T.: Generalized vertex-colorings for partial k-trees. IEICE Trans. Fundamentals\u00a0E83-A(4), 671\u2013677 (2000)","journal-title":"IEICE Trans. Fundamentals"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39890-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,19]],"date-time":"2019-03-19T21:48:43Z","timestamp":1553032123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}