{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:22:12Z","timestamp":1725790932399},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_47","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"538-549","source":"Crossref","is-referenced-by-count":5,"title":["Complexity of Coloring Graphs without Paths and Cycles"],"prefix":"10.1007","author":[{"given":"Pavol","family":"Hell","sequence":"first","affiliation":[]},{"given":"Shenwei","family":"Huang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"47_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":"47_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.tcs.2007.09.031","volume":"389","author":"A. Brandst\u00e4dt","year":"2007","unstructured":"Brandst\u00e4dt, A., Ho\u00e0ng, C.T.: On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. Theoretical Computer Science\u00a0389, 295\u2013306 (2007)","journal-title":"Theoretical Computer Science"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"Broersma, H.J., Fomin, F.V., Golovach, P.A., Paulusma, D.: Three complexity results on coloring P k -free graphs. European Journal of Combinatorics (2012) (in press)","DOI":"10.1016\/j.ejc.2011.12.008"},{"key":"47_CR4","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":"47_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1007\/978-3-642-10631-6_61","volume-title":"Algorithms and Computation","author":"D. Bruce","year":"2009","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)"},{"key":"47_CR6","unstructured":"Chudnovsky, M., Maceli, P., Zhong, M.: Three-coloring graphs with no induced six-edge path I: the triangle-free case (in preparation)"},{"key":"47_CR7","unstructured":"Chudnovsky, M., Maceli, P., Zhong, M.: Three-coloring graphs with no induced six-edge path II: using a triangle (in preparation)"},{"key":"47_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"64","author":"M. Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem. Annals of Mathematics\u00a064, 51\u2013229 (2006)","journal-title":"Annals of Mathematics"},{"key":"47_CR9","unstructured":"Dabrowski, K., Golovach, P., Paulusma, D.: Colouring of graphs with Ramsey-type forbidden subgraphs (submitted)"},{"key":"47_CR10","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman San Faranciso (1979)"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: Coloring graphs without short cycles and long induced paths (2013), http:\/\/www.dur.ac.uk\/daniel.paulusma\/Papers\/Submitted\/girth.pdf","DOI":"10.1016\/j.dam.2013.12.008"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs, San Diego (1980)","DOI":"10.1016\/B978-0-12-289260-8.50010-8"},{"key":"47_CR13","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.\u00a021, 325\u2013356 (1984), Topics on Perfect Graphs","journal-title":"Ann. Discrete Math."},{"key":"47_CR14","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 5-free graphs in polynomial time. Algorithmica\u00a057, 74\u201381 (2010)","journal-title":"Algorithmica"},{"key":"47_CR15","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":"47_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-642-40313-2_49","volume-title":"Mathematical Foundations of Computer Science 2013","author":"S. Huang","year":"2013","unstructured":"Huang, S.: Improved complexity results on k-coloring P t -free graphs. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol.\u00a08087, pp. 551\u2013558. Springer, Heidelberg (2013)"},{"key":"47_CR17","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":"47_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":"47_CR19","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":"47_CR20","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":"47_CR21","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":"47_CR22","doi-asserted-by":"crossref","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":"47_CR23","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. STOC 1978, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"47_CR24","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discrete Mathematics\u00a055, 221\u2013232 (1985)","journal-title":"Discrete Mathematics"},{"key":"47_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":"47_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","LATIN 2014: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T17:31:58Z","timestamp":1565285518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}