{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:39:44Z","timestamp":1725896384877},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_12","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T10:52:03Z","timestamp":1257763923000},"page":"95-104","source":"Crossref","is-referenced-by-count":13,"title":["Three Complexity Results on Coloring P k -Free Graphs"],"prefix":"10.1007","author":[{"given":"Hajo","family":"Broersma","sequence":"first","affiliation":[]},{"given":"Fedor V.","family":"Fomin","sequence":"additional","affiliation":[]},{"given":"Petr A.","family":"Golovach","sequence":"additional","affiliation":[]},{"given":"Dani\u00ebl","family":"Paulusma","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer Graduate Texts in Mathematics, vol.\u00a0244 (2008)","DOI":"10.1007\/978-1-84628-970-5"},{"key":"12_CR2","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. Theor. Comp. Science\u00a043, 337\u2013343 (1986)","journal-title":"Theor. Comp. Science"},{"key":"12_CR3","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":"12_CR4","doi-asserted-by":"crossref","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 (in press), doi:10.1007\/s00453-008-9197-8","DOI":"10.1007\/s00453-008-9197-8"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"van \u2019t Hof, P., Paulusma, D.: A new characterization of P 6-free graphs. Discrete Appl. Math. (in press), doi:10.1016\/j.dam.2008.08.025","DOI":"10.1016\/j.dam.2008.08.025"},{"key":"12_CR6","first-page":"1","volume":"62","author":"M. Hujter","year":"1993","unstructured":"Hujter, M., Tuza, Z.: Precoloring extension II: graph classes related to bipartite graphs. Acta Math. Univ. Comen.\u00a062, 1\u201311 (1993)","journal-title":"Acta Math. Univ. Comen."},{"key":"12_CR7","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., Van Bang Le (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 254\u2013262. Springer, Heidelberg (2001)"},{"key":"12_CR8","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":"12_CR9","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":"12_CR10","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 $\\in {\\sc P}$ for P 6-free graphs. Discrete Appl. Math.\u00a0136, 299\u2013313 (2004)","journal-title":"Discrete Appl. Math."},{"key":"12_CR11","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":"12_CR12","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0095-8956(87)90019-0","volume":"43","author":"A. Tucker","year":"1987","unstructured":"Tucker, A.: A reduction procedure for coloring perfect K 4-free graphs. J. Combin. Theory B\u00a043, 151\u2013172 (1987)","journal-title":"J. Combin. Theory B"},{"key":"12_CR13","doi-asserted-by":"crossref","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"},{"key":"12_CR14","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","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:52:16Z","timestamp":1606168336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}