{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:56Z","timestamp":1759063736052},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642403125"},{"type":"electronic","value":"9783642403132"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40313-2_49","type":"book-chapter","created":{"date-parts":[[2013,8,16]],"date-time":"2013-08-16T10:36:43Z","timestamp":1376649403000},"page":"551-558","source":"Crossref","is-referenced-by-count":8,"title":["Improved Complexity Results on k-Coloring P t -Free Graphs"],"prefix":"10.1007","author":[{"given":"Shenwei","family":"Huang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"49_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-31155-0_13","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"A. Atminas","year":"2012","unstructured":"Atminas, A., Lozin, V.V., Razgon, I.: Linear time algorithm for computing a small biclique in graphs without long induced paths. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 142\u2013152. Springer, Heidelberg (2012)"},{"issue":"1","key":"49_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jagm.1993.1001","volume":"14","author":"H.L. Bodlaender","year":"1993","unstructured":"Bodlaender, H.L.: On linear time minor tests with depth-first search. J. Algorithms\u00a014(1), 1\u201323 (1993)","journal-title":"J. Algorithms"},{"key":"49_CR3","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":"49_CR4","doi-asserted-by":"crossref","unstructured":"Broersma, H.J., Fomin, F.V., Golovach, P.A., Paulusma, D.: Three complexity results on coloring P\n                        \n                  k\n                -free graphs. European Journal of Combinatorics (2012) (in press)","DOI":"10.1016\/j.ejc.2011.12.008"},{"key":"49_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. Theoret. Comput. Sci.\u00a0423, 1\u201310 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"49_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 learn forest. Theoret. Comput. Sci.\u00a0414, 9\u201319 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR7","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s00493-005-0012-8","volume":"25","author":"M. Chudnovsky","year":"2005","unstructured":"Chudnovsky, M., Cornu\u00e9jols, G., Liu, X., Seymour, P., Vu\u0161kovi\u0107, K.: Recognizing Berge graphs. Combinatorica\u00a025, 143\u2013187 (2005)","journal-title":"Combinatorica"},{"key":"49_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/10692760_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"B. Courcelle","year":"1998","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol.\u00a01517, pp. 1\u201316. Springer, Heidelberg (1998)"},{"key":"49_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.V., Raman, R., Ries, B.: Colouring vertices of triangle-free graphs without forests. Discrete Math.\u00a0312, 1372\u20131385 (2012)","journal-title":"Discrete Math."},{"key":"49_CR10","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. Sci.\u00a043, 337\u2013343 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman San Faranciso (1979)"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: 4-coloring H-free graphs when H is small. Discrete Applied Mathematics (2012) (in press)","DOI":"10.1007\/978-3-642-27660-6_24"},{"key":"49_CR13","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":"49_CR14","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":"49_CR15","first-page":"325","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. 21, 325\u2013356 (1984), Topics on Perfect Graphs","journal-title":"Ann. Discrete Math."},{"key":"49_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.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":"49_CR17","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge coloring. SIAM J. Comput.\u00a010, 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Huang, S.H.: Improved complexity results on k-coloring P\n                        \n                  t\n                -free graphs. arXiv: 0700726 [cs.CC] (2013)","DOI":"10.1007\/978-3-642-40313-2_49"},{"key":"49_CR19","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. Contrib. Discrete. Mah.\u00a02, 61\u201366 (2007)","journal-title":"Contrib. Discrete. Mah."},{"key":"49_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","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., Le, V.B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 254\u2013262. Springer, Heidelberg (2001)"},{"key":"49_CR21","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. Theoret. Comput. Sci.\u00a0389, 330\u2013335 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"49_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","volume":"4","author":"D. Leven","year":"1983","unstructured":"Leven, D., Galil, Z.: NP-completeness of finding the chromatic index of regular graphs. J. Algorithm\u00a04, 35\u201344 (1983)","journal-title":"J. Algorithm"},{"key":"49_CR23","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\n                        6-free graphs. Discrete Appl. Math.\u00a0136, 299\u2013313 (2004)","journal-title":"Discrete Appl. Math."},{"key":"49_CR24","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 fibidden subgraphs-a survey. Graphs Combin.\u00a020, 1\u201340 (2004)","journal-title":"Graphs Combin."},{"key":"49_CR25","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"},{"key":"49_CR26","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 Cybernet.\u00a015, 107\u2013117 (2001)","journal-title":"Acta Cybernet."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40313-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:32:13Z","timestamp":1558017133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40313-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642403125","9783642403132"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40313-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}