{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:42:51Z","timestamp":1725698571477},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325885"},{"type":"electronic","value":"9783642325892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32589-2_40","type":"book-chapter","created":{"date-parts":[[2012,8,1]],"date-time":"2012-08-01T04:44:32Z","timestamp":1343796272000},"page":"443-454","source":"Crossref","is-referenced-by-count":1,"title":["Coloring Graphs Characterized by a Forbidden Subgraph"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Ries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S. Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Applied Mathematics\u00a023, 11\u201324 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0095-8956(91)90068-U","volume":"52","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a forest. J. Comb. Theory, Ser. B\u00a052, 274\u2013283 (1991)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2011.10.005","volume":"414","author":"H.J. Broersma","year":"2012","unstructured":"Broersma, H.J., Golovach, P.A., Paulusma, D., Song, J.: Updating the complexity status of coloring graphs without a fixed induced linear forest. Theoretical Computer Science\u00a0414, 9\u201319 (2012)","journal-title":"Theoretical Computer Science"},{"key":"40_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics\u00a0164, 51\u2013229 (2006)","journal-title":"Annals of Mathematics"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, Electronic Edition. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: Proceedings of the sixth annual ACM Symposium on Theory of Computing (STOC 1974), pp. 47\u201363 (1974)","DOI":"10.1145\/800119.803884"},{"key":"40_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-27660-6_24","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"P.A. Golovach","year":"2012","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: 4-Coloring H-Free Graphs When H Is Small. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol.\u00a07147, pp. 289\u2013300. Springer, Heidelberg (2012)"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0304-0208(08)72943-8","volume":"21","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. Ann. Discrete Math., Topics on Perfect Graphs\u00a021, 325\u2013356 (1984)","journal-title":"Ann. Discrete Math., Topics on Perfect Graphs"},{"key":"40_CR9","first-page":"15","volume":"2","author":"M. Kami\u0144ski","year":"2007","unstructured":"Kami\u0144ski, M., Lozin, V.V.: Vertex 3-colorability of claw-free graphs. Algorithmic Operations Research\u00a02, 15\u201321 (2007)","journal-title":"Algorithmic Operations Research"},{"key":"40_CR10","first-page":"61","volume":"2","author":"M. Kami\u0144ski","year":"2007","unstructured":"Kami\u0144ski, M., Lozin, V.V.: Coloring edges and vertices of graphs without short or long cycles. Contributions to Discrete Math.\u00a02, 61\u201366 (2007)","journal-title":"Contributions to Discrete Math."},{"key":"40_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-45477-2_23","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"D. Kr\u00e1l","year":"2001","unstructured":"Kr\u00e1l, D., Kratochv\u00edl, J., Tuza, Z., Woeginger, G.J.: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. In: Brandst\u00e4dt, A., Van Le, B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 254\u2013262. Springer, Heidelberg (2001)"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0012-365X(97)89267-9","volume":"162","author":"F. Maffray","year":"1996","unstructured":"Maffray, F., Preissmann, M.: On the NP-completeness of the k-colorability problem for triangle-free graphs. Discrete Math.\u00a0162, 313\u2013317 (1996)","journal-title":"Discrete Math."},{"key":"40_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-003-0540-1","volume":"20","author":"B. Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: Vertex colouring and forbidden subgraphs - a survey. Graphs Combin.\u00a020, 1\u201340 (2004)","journal-title":"Graphs Combin."},{"key":"40_CR14","doi-asserted-by":"publisher","first-page":"161","DOI":"10.7151\/dmgt.1049","volume":"17","author":"Z. Tuza","year":"1997","unstructured":"Tuza, Z.: Graph colorings with local restrictions - a survey. Discuss. Math. Graph Theory\u00a017, 161\u2013228 (1997)","journal-title":"Discuss. Math. Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32589-2_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:08:09Z","timestamp":1620115689000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32589-2_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325885","9783642325892"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32589-2_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}