{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:59:19Z","timestamp":1725465559790},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382321"},{"type":"electronic","value":"9783642382338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38233-8_24","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T08:57:16Z","timestamp":1368608236000},"page":"288-299","source":"Crossref","is-referenced-by-count":3,"title":["List Coloring in the Absence of Two Subgraphs"],"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"}]}],"member":"297","reference":[{"key":"24_CR1","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":"24_CR2","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00224-005-1199-1","volume":"39","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Engelfriet, J., Le, H.-O., Lozin, V.V.: Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst.\u00a039, 561\u2013590 (2006)","journal-title":"Theory Comput. Syst."},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.dam.2004.01.009","volume":"145","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Kratsch, D.: On the structure of (P\n                5, gem)-free graphs. Discrete Applied Mathematics\u00a0145, 155\u2013166 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/S0129054104002364","volume":"15","author":"A. Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt, A., Le, H.-O., Mosca, R.: Gem- and co-gem-free graphs have bounded clique-width. Internat. J. Found. Comput Sci.\u00a015, 163\u2013185 (2004)","journal-title":"Internat. J. Found. Comput Sci."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2011.12.076","volume":"423","author":"H.J. Broersma","year":"2012","unstructured":"Broersma, H.J., Golovach, P.A., Paulusma, D., Song, J.: Determining the chromatic number of triangle-free 2P\n                3-free graphs in polynomial time. Theoretical Computer Science\u00a0423, 1\u201310 (2012)","journal-title":"Theoretical Computer Science"},{"key":"24_CR6","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":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-25870-1_12","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J.-F. Couturier","year":"2011","unstructured":"Couturier, J.-F., Golovach, P.A., Kratsch, D., Paulusma, D.: List coloring in the absence of a linear forest. In: Kolman, P., Kratochv\u00edl, J. (eds.) WG 2011. LNCS, vol.\u00a06986, pp. 119\u2013130. Springer, Heidelberg (2011)"},{"key":"24_CR8","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1137\/S0097539792225297","volume":"23","author":"E. Dahlhaus","year":"1994","unstructured":"Dahlhaus, E., Johnson, D.S., Papadimitriou, C.H., Seymour, P.D., Yannakakis, M.: The complexity of multiterminal cuts. SIAM J. Comput.\u00a023, 864\u2013894 (1994)","journal-title":"SIAM J. Comput."},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1016\/j.disc.2011.12.012","volume":"312","author":"K. Dabrowski","year":"2012","unstructured":"Dabrowski, K., Lozin, V., Raman, R., Ries, B.: Colouring vertices of triangle-free graphs without forests. Discrete Mathematics\u00a0312, 1372\u20131385 (2012)","journal-title":"Discrete Mathematics"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-642-03816-7_33","volume-title":"Mathematical Foundations of Computer Science 2009","author":"P.A. Golovach","year":"2009","unstructured":"Golovach, P.A., Heggernes, P.: Choosability of P\n                5-free graphs. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 382\u2013391. Springer, Heidelberg (2009)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-642-32589-2_40","volume-title":"Mathematical Foundations of Computer Science 2012","author":"P.A. Golovach","year":"2012","unstructured":"Golovach, P.A., Paulusma, D., Ries, B.: Coloring Graphs Characterized by a Forbidden Subgraph. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 443\u2013454. Springer, Heidelberg (2012)"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-642-22953-4_17","volume-title":"Fundamentals of Computation Theory","author":"P.A. Golovach","year":"2011","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: Coloring graphs without short cycles and long induced paths. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol.\u00a06914, pp. 193\u2013204. Springer, Heidelberg (2011)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-35261-4_5","volume-title":"Algorithms and Computation","author":"P.A. Golovach","year":"2012","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: Closing complexity gaps for coloring problems on H-free graphs. In: Chao, K.-M., Hsu, T.-s., Lee, D.-T. (eds.) ISAAC 2012. LNCS, vol.\u00a07676, pp. 14\u201323. Springer, Heidelberg (2012)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.dam.2012.08.022","volume":"161","author":"P.A. Golovach","year":"2013","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: 4-Coloring H-free graphs when H is small. Discrete Applied Mathematics\u00a0161, 140\u2013150 (2013)","journal-title":"Discrete Applied Mathematics"},{"issue":"3-4","key":"24_CR15","doi-asserted-by":"crossref","first-page":"413","DOI":"10.4064\/am-19-3-4-413-441","volume":"XIX","author":"A. Gy\u00e1rf\u00e1s","year":"1987","unstructured":"Gy\u00e1rf\u00e1s, A.: Problems from the world surrounding perfect graphs. Zastosowania Matematyki Applicationes Mathematicae\u00a0XIX (3-4), 413\u2013441 (1987)","journal-title":"Zastosowania Matematyki Applicationes Mathematicae"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/jgt.20635","volume":"71","author":"C.T. Ho\u00e0ng","year":"2012","unstructured":"Ho\u00e0ng, C.T., Maffray, F., Mechebbek, M.: A characterization of b-perfect graphs. Journal of Graph Theory\u00a071, 95\u2013122 (2012)","journal-title":"Journal of Graph Theory"},{"key":"24_CR17","unstructured":"Jansen, K.: Complexity Results for the Optimum Cost Chromatic Partition Problem, Universit\u00e4t Trier, Mathematik\/Informatik, Forschungsbericht 96\u201341 (1996)"},{"key":"24_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K. Jansen","year":"1997","unstructured":"Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discrete Appl. Math.\u00a075, 135\u2013155 (1997)","journal-title":"Discrete Appl. Math."},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(02)00198-1","volume":"126","author":"D. Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Applied Mathematics\u00a0126, 197\u2013221 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR20","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\u2019","year":"2001","unstructured":"Kr\u00e1l\u2019, D., Kratochv\u00edl, J., Tuza, Z., Woeginger, G.J.: Complexity of coloring graphs without forbidden induced subgraphs. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, p. 254. Springer, Heidelberg (2001)"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0166-218X(94)90150-3","volume":"50","author":"J. Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Tsuza, Z.: Algorithmic complexity of list colorings. Discrete Applied Mathematics\u00a050, 297\u2013302 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-642-34611-8_7","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S. Kratsch","year":"2012","unstructured":"Kratsch, S., Schweitzer, P.: Graph isomorphism for graph classes characterized by two forbidden induced subgraphs. In: Golumbic, M.C., Stern, M., Levy, A., Morgenstern, G. (eds.) WG 2012. LNCS, vol.\u00a07551, pp. 34\u201345. Springer, Heidelberg (2012)"},{"key":"24_CR23","doi-asserted-by":"publisher","first-page":"4023","DOI":"10.1016\/j.tcs.2010.08.027","volume":"411","author":"V.V. Lozin","year":"2010","unstructured":"Lozin, V.V.: A decidability result for the dominating set problem. Theoretical Computer Science\u00a0411, 4023\u20134027 (2010)","journal-title":"Theoretical Computer Science"},{"key":"24_CR24","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 Mathematics\u00a0162, 313\u2013317 (1996)","journal-title":"Discrete Mathematics"},{"key":"24_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-35843-2_29","volume-title":"SOFSEM 2013: Theory and Practice of Computer Science","author":"G.B. Mertzios","year":"2013","unstructured":"Mertzios, G.B., Spirakis, P.G.: Algorithms and almost tight results for 3-colorability of small diameter graphs. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol.\u00a07741, pp. 332\u2013343. Springer, Heidelberg (2013)"},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley Interscience (1995)","DOI":"10.1002\/9781118032497"},{"key":"24_CR27","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0012-365X(03)00312-1","volume":"276","author":"B. Randerath","year":"2004","unstructured":"Randerath, B.: 3-colorability and forbidden subgraphs. I., Characterizing pairs. Discrete Mathematics\u00a0276, 313\u2013325 (2004)","journal-title":"Discrete Mathematics"},{"key":"24_CR28","first-page":"3","volume":"26","author":"B. Randerath","year":"2002","unstructured":"Randerath, B., Schiermeyer, I.: A note on Brooks\u2019 theorem for triangle-free graphs. Australas. J. Combin.\u00a026, 3\u20139 (2002)","journal-title":"Australas. J. Combin."},{"key":"24_CR29","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":"24_CR30","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"24_CR31","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.disc.2005.03.003","volume":"295","author":"D. Schindl","year":"2005","unstructured":"Schindl, D.: Some new hereditary classes where graph coloring remains NP-hard. Discrete Math.\u00a0295, 197\u2013202 (2005)","journal-title":"Discrete Math."},{"key":"24_CR32","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","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38233-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T21:27:56Z","timestamp":1557696476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38233-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382321","9783642382338"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38233-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}