{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T12:04:34Z","timestamp":1750161874435},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_33","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T14:43:03Z","timestamp":1250692983000},"page":"382-391","source":"Crossref","is-referenced-by-count":7,"title":["Choosability of P 5-Free Graphs"],"prefix":"10.1007","author":[{"given":"Petr A.","family":"Golovach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","series-title":"London Math. Soc. Lecture Note Ser.","first-page":"1","volume-title":"Surveys in combinatorics","author":"N. Alon","year":"1993","unstructured":"Alon, N.: Restricted colorings of graphs. In: Surveys in combinatorics. London Math. Soc. Lecture Note Ser., vol.\u00a0187, pp. 1\u201333. Cambridge Univ. Press, Cambridge (1993)"},{"key":"33_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 \n                    \n                      \n                    \n                    $P\\sb 5$\n                  -free graphs. Period. Math. Hungar.\u00a021, 303\u2013308 (1990)","journal-title":"Period. Math. Hungar."},{"key":"33_CR3","series-title":"SIAM Monographs on Discrete Mathematics and Applications","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes: a survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics (SIAM), Philadelphia (1999)"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput.\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"33_CR5","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, Heidelberg (1999)"},{"key":"33_CR6","unstructured":"Erd\u0151s, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing, Humboldt State Univ., Arcata, Calif, 1980, Utilitas Math., pp.\u00a0125\u2013157 (1979)"},{"key":"33_CR7","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"33_CR8","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman and Co., San Francisco (1979)"},{"key":"33_CR9","unstructured":"Gutner, S., Tarsi, M.: Some results on (a:b)-choosability, CoRR, abs\/0802.1338 (2008)"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-540-85238-4_31","volume-title":"Mathematical Foundations of Computer Science 2008","author":"C.T. Ho\u00e0ng","year":"2008","unstructured":"Ho\u00e0ng, C.T., Kami\u0144ski, M., Lozin, V.V., Sawada, J., Shu, X.: A note on k-colorability of p5-free graphs. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 387\u2013394. Springer, Heidelberg (2008)"},{"key":"33_CR11","volume-title":"Graph Coloring Problems","author":"T.R. Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley Interscience, Hoboken (1995)"},{"key":"33_CR12","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., Van Le, B. (eds.) WG 2001. LNCS, vol.\u00a02204, pp. 254\u2013262. Springer, Heidelberg (2001)"},{"key":"33_CR13","unstructured":"Mahadev, N.V.R., Roberts, F.S., Santhanakrishnan, P.: 3-choosable complete bipartite graphs, Technical Report 49-91, Rutgers University, New Brunswick, NJ (1991)"},{"key":"33_CR14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"33_CR15","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 Appl. Math.\u00a0136, 299\u2013313 (2004); The 1st Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW 2001)","journal-title":"Discrete Appl. Math."},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jctb.1994.1062","volume":"62","author":"C. Thomassen","year":"1994","unstructured":"Thomassen, C.: Every planar graph is 5-choosable. J. Combin. Theory Ser. B\u00a062, 180\u2013181 (1994)","journal-title":"J. Combin. Theory Ser. B"},{"key":"33_CR17","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\u2014a survey. Discuss. Math. Graph Theory\u00a017, 161\u2013228 (1997)","journal-title":"Discuss. Math. Graph Theory"},{"key":"33_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-540-69733-6_41","volume-title":"Computing and Combinatorics","author":"P. Hof van \u2019t","year":"2008","unstructured":"van \u2019t Hof, P., Paulusma, D.: A new characterization of p6-free graphs. In: Hu, X., Wang, J. (eds.) COCOON 2008. LNCS, vol.\u00a05092, pp. 415\u2013424. Springer, Heidelberg (2008)"},{"key":"33_CR19","first-page":"3","volume":"101","author":"V.G. Vizing","year":"1976","unstructured":"Vizing, V.G.: Coloring the vertices of a graph in prescribed colors. Diskret. Analiz\u00a0101, 3\u201310 (1976)","journal-title":"Diskret. Analiz"},{"key":"33_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 Cybernet.\u00a015, 107\u2013117 (2001)","journal-title":"Acta Cybernet."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T13:13:58Z","timestamp":1552137238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}