{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:21:51Z","timestamp":1725571311238},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175138"},{"type":"electronic","value":"9783642175145"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-17514-5_14","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:09:23Z","timestamp":1291388963000},"page":"156-167","source":"Crossref","is-referenced-by-count":1,"title":["On Coloring Graphs without Induced Forests"],"prefix":"10.1007","author":[{"given":"Hajo","family":"Broersma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer Graduate Texts in Mathematics\u00a0244 (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-642-10217-2_12","volume-title":"Combinatorial Algorithms","author":"H.J. Broersma","year":"2009","unstructured":"Broersma, H.J., Fomin, F.V., Golovach, P.A., Paulusma, D.: Three complexity results on coloring P k -free graphs. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 95\u2013104. Springer, Heidelberg (2009)"},{"key":"14_CR3","unstructured":"Broersma, H.J., Golovach, P.A., Paulusma, D., Song, J.: Narrowing down the gap on the complexity of coloring P k -free graphs. In: Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010). LNCS (to appear, 2010)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Bruce, D., Ho\u00e0ng, C.T., Sawada, J.: A certifying algorithm for 3-colorability of P 5-free graphs. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 594\u2013604. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-10631-6_61"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Dabrowski, K., Lozin, V., Raman, R., Ries, B.: Colouring vertices of triangle-free graphs. In: Proceedings of the 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010). LNCS (to appear, 2010)","DOI":"10.1007\/978-3-642-16926-7_18"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/0304-3975(86)90184-2","volume":"43","author":"K. Edwards","year":"1986","unstructured":"Edwards, K.: The complexity of coloring problems on dense graphs. Theoret. Comput. Science\u00a043, 337\u2013343 (1986)","journal-title":"Theoret. Comput. Science"},{"key":"14_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"14_CR9","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 5-free graphs in polynomial time. Algorithmica\u00a057, 74\u201381 (2010)","journal-title":"Algorithmica"},{"key":"14_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":"14_CR11","unstructured":"Kami\u0144ski, M., Lozin, V.V.: Vertex 3-colorability of Claw-free Graphs. Algorithmic Operations Research\u00a021 (2007)"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1137\/S0097539702418759","volume":"32","author":"M. Kochol","year":"2003","unstructured":"Kochol, M., Lozin, V.V., Randerath, B.: The 3-Colorability Problem on Graphs with Maximum Degree Four. SIAM J. Comput.\u00a032, 1128\u20131139 (2003)","journal-title":"SIAM J. Comput."},{"key":"14_CR13","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., et al.: Complexity of coloring graphs without forbidden induced subgraphs. In: Brandst\u00e4dt, A., Le Van, B. (eds.) WG 2001. LNCS, vol.\u00a02204, p. 254. Springer, Heidelberg (2001)"},{"key":"14_CR14","first-page":"139","volume":"62","author":"J. Kratochv\u00edl","year":"1993","unstructured":"Kratochv\u00edl, J.: Precoloring extension with fixed color bound. Acta Math. Univ. Comen.\u00a062, 139\u2013153 (1993)","journal-title":"Acta Math. Univ. Comen."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1016\/j.tcs.2007.09.009","volume":"389","author":"V.B. Le","year":"2007","unstructured":"Le, V.B., Randerath, B., Schiermeyer, I.: On the complexity of 4-coloring graphs without long induced paths. Theor. Comp. Science\u00a0389, 330\u2013335 (2007)","journal-title":"Theor. Comp. Science"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.dam.2004.07.006","volume":"146","author":"V. Lozin","year":"2005","unstructured":"Lozin, V., Mosca, R.: Independent sets in extensions of 2K 2-free graphs. Discrete Appl. Math.\u00a0146, 74\u201380 (2005)","journal-title":"Discrete Appl. Math."},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0166-218X(03)00446-3","volume":"136","author":"B. Randerath","year":"2004","unstructured":"Randerath, B., Schiermeyer, I.: 3-Colorability \u2208 P for P 6-free graphs. Discrete Appl. Math.\u00a0136, 299\u2013313 (2004)","journal-title":"Discrete Appl. Math."},{"key":"14_CR18","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 Combin.\u00a020, 1\u201340 (2004)","journal-title":"Graphs and Combin."},{"key":"14_CR19","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 constraints - a survey. Discuss. Math. Graph Theory\u00a017, 161\u2013228 (1997)","journal-title":"Discuss. Math. Graph Theory"},{"key":"14_CR20","first-page":"107","volume":"15","author":"G.J. Woeginger","year":"2001","unstructured":"Woeginger, G.J., Sgall, J.: The complexity of coloring graphs without long induced paths. Acta Cybern.\u00a015, 107\u2013117 (2001)","journal-title":"Acta Cybern."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17514-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:19Z","timestamp":1559836159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17514-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175138","9783642175145"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17514-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}