{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:47:02Z","timestamp":1725756422463},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450426"},{"type":"electronic","value":"9783642450433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45043-3_18","type":"book-chapter","created":{"date-parts":[[2013,11,12]],"date-time":"2013-11-12T14:05:50Z","timestamp":1384265150000},"page":"201-212","source":"Crossref","is-referenced-by-count":0,"title":["Colouring of Graphs with Ramsey-Type Forbidden Subgraphs"],"prefix":"10.1007","author":[{"given":"Konrad K.","family":"Dabrowski","sequence":"first","affiliation":[]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","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":"18_CR2","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":"18_CR3","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":"18_CR4","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":"18_CR5","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":"18_CR6","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":"18_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.jda.2012.04.008","volume":"15","author":"J.F. Couturier","year":"2012","unstructured":"Couturier, J.F., Golovach, P.A., Kratsch, D., Paulusma, D.: On the parameterized complexity of coloring graphs in the absence of linear forest. Journal of Discrete Algorithms\u00a015, 56\u201362 (2012)","journal-title":"Journal of Discrete Algorithms"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.jda.2011.12.012","volume":"14","author":"K. Dabrowski","year":"2012","unstructured":"Dabrowski, K., Lozin, V., M\u00fcller, H., Rautenbach, D.: Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number. Journal of Discrete Algorithms\u00a014, 207\u2013213 (2012)","journal-title":"Journal of Discrete Algorithms"},{"key":"18_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":"18_CR10","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, Electronic Edition. Springer (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-38233-8_24","volume-title":"Algorithms and Complexity","author":"P.A. Golovach","year":"2013","unstructured":"Golovach, P.A., Paulusma, D.: List coloring in the absence of two subgraphs. In: Spirakis, P.G., Serna, M. (eds.) CIAC 2013. LNCS, vol.\u00a07878, pp. 288\u2013299. Springer, Heidelberg (2013)"},{"key":"18_CR12","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"},{"key":"18_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":"18_CR14","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0012-365X(03)00197-3","volume":"272","author":"S. Gravier","year":"2003","unstructured":"Gravier, S., Ho\u00e1ng, C.T., Maffray, F.: Coloring the hypergraph of maximal cliques of a graph with no long path. Discrete Mathematics\u00a0272, 285\u2013290 (2003)","journal-title":"Discrete Mathematics"},{"issue":"3-4","key":"18_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":"18_CR16","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s00453-008-9197-8","volume":"57","author":"C.T. Ho\u00e0ng","year":"2010","unstructured":"Ho\u00e0ng, C.T., Kami\u0144ski, M., Lozin, V., Sawada, J., Shu, X.: Deciding k-colorability of P\n                        5-free graphs in polynomial time. Algorithmica\u00a057, 74\u201381 (2010)","journal-title":"Algorithmica"},{"key":"18_CR17","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":"18_CR18","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, pp. 254\u2013262. Springer, Heidelberg (2001)"},{"key":"18_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":"18_CR20","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":"18_CR21","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":"18_CR22","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":"J. Combin."},{"key":"18_CR23","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 and Combinatorics\u00a020, 1\u201340 (2004)","journal-title":"Graphs and Combinatorics"},{"issue":"9","key":"18_CR24","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.dam.2010.01.007","volume":"158","author":"B. Randerath","year":"2010","unstructured":"Randerath, B., Schiermeyer, I.: On maximum independent sets in P\n                        5-free graphs. Discrete Applied Mathematics\u00a0158(9), 1041\u20131044 (2010)","journal-title":"Discrete Applied Mathematics"},{"key":"18_CR25","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 Mathematics\u00a0295, 197\u2013202 (2005)","journal-title":"Discrete Mathematics"},{"key":"18_CR26","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":"Math. Graph Theory"}],"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-642-45043-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T05:58:12Z","timestamp":1558677492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45043-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450426","9783642450433"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45043-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}