{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:49:14Z","timestamp":1759063754129},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852377"},{"type":"electronic","value":"9783540852384"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85238-4_31","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T15:34:36Z","timestamp":1219073676000},"page":"387-394","source":"Crossref","is-referenced-by-count":6,"title":["A Note on k-Colorability of P 5-Free Graphs"],"prefix":"10.1007","author":[{"given":"Ch\u00ednh T.","family":"Ho\u00e0ng","sequence":"first","affiliation":[]},{"given":"Marcin","family":"Kami\u0144ski","sequence":"additional","affiliation":[]},{"given":"Vadim","family":"Lozin","sequence":"additional","affiliation":[]},{"given":"Joe","family":"Sawada","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Shu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","volume-title":"Perfect Graphs","author":"J.L. Ramirez Alfonsin","year":"2001","unstructured":"Ramirez Alfonsin, J.L., Reed, B.A.: Perfect Graphs. John Wiley & Sons, LTD, Chichester (2001)"},{"issue":"4","key":"31_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF02352694","volume":"21","author":"G. Bacs\u00f3","year":"1990","unstructured":"Bacs\u00f3, G., Tuza, Z.: Dominating cliques in P\n                  5-free graphs. Period. Math. Hungar.\u00a021(4), 303\u2013308 (1990)","journal-title":"Period. Math. Hungar."},{"volume-title":"Topics on perfect graphs","year":"1984","unstructured":"Berge, C., Chv\u00e1tal, V. (eds.): Topics on perfect graphs. North-Holland, Amsterdam (1984)","key":"31_CR3"},{"key":"31_CR4","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/321707.321710","volume":"19","author":"S. Even","year":"1972","unstructured":"Even, S., Pnueli, A., Lempel, A.: Permutation graphs and transitive graphs. J. Assoc. Comput. Mach.\u00a019, 400\u2013410 (1972)","journal-title":"J. Assoc. Comput. Mach."},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. Theoretical Computer Science\u00a01, 237\u2013267 (1976)","journal-title":"Theoretical Computer Science"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum coloring by cliques, and maximum independent set of a chordal graph. SIAM J. Comput.\u00a01, 180\u2013187 (1972)","journal-title":"SIAM J. Comput."},{"key":"31_CR7","volume-title":"Algorithmic graph theory and perfect graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)"},{"key":"31_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., Schrjver, A.: The ellipsoid method and its consequences in combinatorial optimization. Combinatorica\u00a01, 169\u2013197 (1981)","journal-title":"Combinatorica"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF01788689","volume":"5","author":"R. Hayward","year":"1989","unstructured":"Hayward, R., Ho\u00e0ng, C.T., Maffray, F.: Optimizing weakly triangulated graphs. Graphs and Combinatorics\u00a05, 339\u2013349 (1989)","journal-title":"Graphs and Combinatorics"},{"key":"31_CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"31_CR11","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. Kral","year":"2001","unstructured":"Kral, D., Kratochvil, J., Tuza, Z., Woeginger, G.J.: Complexity of Coloring Graphs without Forbidden Induced Subgraphs. In: Brandst\u00e4dt, A., Van Le, B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 254\u2013262. Springer, Heidelberg (2001)"},{"issue":"1-2","key":"31_CR12","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. Theoretical Computer Science\u00a0389(1-2), 330\u2013335 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"2-3","key":"31_CR13","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\u2009P for P\n                  6-free graphs. Discrete Applied Mathematics\u00a0136(2-3), 299\u2013313 (2004)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"31_CR14","first-page":"107","volume":"15","author":"J. Sgall","year":"2001","unstructured":"Sgall, J., Woeginger, G.J.: The complexity of coloring graphs without long induced paths. Acta Cybernet\u00a015(1), 107\u2013117 (2001)","journal-title":"Acta Cybernet"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:31:21Z","timestamp":1619523081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540852377","9783540852384"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}