{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:51Z","timestamp":1759638111745,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":70,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531730"},{"type":"electronic","value":"9783662531747"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53174-7_2","type":"book-chapter","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T14:50:06Z","timestamp":1470322206000},"page":"16-30","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Open Problems on Graph Coloring for Special Graph Classes"],"prefix":"10.1007","author":[{"given":"Dani\u00ebl","family":"Paulusma","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,5]]},"reference":[{"key":"2_CR1","unstructured":"Aboulker, P., Brettell, N., Havet, F., Marx, D., Trotignon, N.: Colouring graphs with constraints on connectivity, Manuscript. arXiv:1505.01616"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Appel, K., Haken, W.: Every planar map is four colorable. In: Contemporary Mathematics, vol. 89. AMS Bookstore (1989)","DOI":"10.1090\/conm\/098"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(89)90031-0","volume":"23","author":"S Arnborg","year":"1989","unstructured":"Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23, 11\u201324 (1989)","journal-title":"Discrete Appl. Math."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-008-0391-5","volume":"169","author":"F Bonomo","year":"2009","unstructured":"Bonomo, F., Dur\u00e1n, G., Marenco, J.: Exploring the complexity boundary between coloring and list-coloring. Ann. Oper. Res. 169, 3\u201316 (2009)","journal-title":"Ann. Oper. Res."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.46298\/dmtcs.372","volume":"8","author":"A Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Klembt, T., Mahfud, S.: $$P_6$$ - and triangle-free graphs revisited: structure and bounded clique-width. Discrete Math. Theor. Comput. Sci. 8, 173\u2013188 (2006)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1137\/060668675","volume":"22","author":"HJ Broersma","year":"2008","unstructured":"Broersma, H.J., Capponi, A., Paulusma, D.: A new algorithm for on-line coloring bipartite graphs. SIAM J. Discrete Math. 22, 72\u201391 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1137\/S0895480197326346","volume":"12","author":"HJ Broersma","year":"1999","unstructured":"Broersma, H.J., Kloks, T., Kratsch, D., M\u00fcller, H.: Independent sets in asteroidal triple-free graphs. SIAM J. Discrete Math. 12, 276\u2013287 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"RL Brooks","year":"1941","unstructured":"Brooks, R.L.: On colouring the nodes of a network. Math. Proc. Cambridge Philos. Soc. 37, 194\u2013197 (1941)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1016\/S0166-218X(02)00242-1","volume":"127","author":"L Cai","year":"2003","unstructured":"Cai, L.: Parameterized complexity of vertex coloring. Discrete Appl. Math. 127, 415\u2013429 (2003)","journal-title":"Discrete Appl. Math."},{"key":"2_CR10","unstructured":"Cao, Y.: Linear recognition of almost (unit) interval graphs, Manuscript. arXiv:1403.1515"},{"key":"2_CR11","first-page":"61","volume":"AF","author":"I Cie\u015blik","year":"2006","unstructured":"Cie\u015blik, I., Kozik, M., Micek, P.: On-line coloring of $$I_s$$ -free graphs and co-planar graphs. Discrete Math. Theor. Comput. Sci. Proc. AF, 61\u201368 (2006)","journal-title":"Discrete Math. Theor. Comput. Sci. Proc."},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"1960","DOI":"10.1016\/j.dam.2006.03.014","volume":"154","author":"M Chleb\u00edk","year":"2006","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Hard coloring problems in low degree planar bipartite graphs. Discrete Appl. Math. 154, 1960\u20131965 (2006)","journal-title":"Discrete Appl. Math."},{"key":"2_CR13","first-page":"291","volume":"IV","author":"M Chudnovsky","year":"2014","unstructured":"Chudnovsky, M.: Coloring graphs with forbidden induced subgraphs. Proc. ICM IV, 291\u2013302 (2014)","journal-title":"Proc. ICM"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem. Ann. Math. 164, 51\u2013229 (2006)","journal-title":"Ann. Math."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1137\/S0097539701385351","volume":"34","author":"DG Corneil","year":"2005","unstructured":"Corneil, D.G., Rotics, U.: On the relationship between clique-width and treewidth. SIAM J. Comput. 34, 825\u2013847 (2005)","journal-title":"SIAM J. Comput."},{"key":"2_CR16","unstructured":"Dabrowski, K.K., Dross, F., Johnson, M., Paulusma, D.: Filling the complexity gaps for colouring planar, bounded degree graphs, Manuscript. arXiv:1506.06564"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.tcs.2012.10.046","volume":"472","author":"M Demange","year":"2013","unstructured":"Demange, M., de Werra, D.: On some coloring problems in grids. Theoret. Comput. Sci. 472, 9\u201327 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-32589-2_32","volume-title":"Mathematical Foundations of Computer Science 2012","author":"M Doucha","year":"2012","unstructured":"Doucha, M., Kratochv\u00edl, J.: Cluster vertex deletion: a parameterization between vertex cover and clique-width. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 348\u2013359. Springer, Heidelberg (2012)"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0963548398003678","volume":"7","author":"T Emden-Weinert","year":"1998","unstructured":"Emden-Weinert, T., Hougardy, S., Kreuter, B.: Uniquely colourable graphs and the hardness of colouring graphs of large girth. Comb. Probab. Comput. 7, 375\u2013386 (1998)","journal-title":"Comb. Probab. Comput."},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"1675","DOI":"10.1137\/13090465X","volume":"28","author":"J Enright","year":"2014","unstructured":"Enright, J., Stewart, L., Tardos, G.: On list coloring and list homomorphism of permutation and interval graphs. SIAM J. Discrete Math. 28, 1675\u20131685 (2014)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ic.2010.11.026","volume":"209","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Fomin, F.V., Lokshtanov, D., Rosamond, F., Saurabh, S., Szeider, S., Thomassen, C.: On the complexity of some colorful problems parameterized by treewidth. Inf. Comput. 209, 143\u2013153 (2011)","journal-title":"Inf. Comput."},{"key":"2_CR22","unstructured":"Felsner, S., Micek, P., Ueckerdt, T.: On-line coloring between two lines. In: Proceedings SoCG 2015, LIPIcs, vol. 34, pp. 630\u2013641 (2015)"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"2514","DOI":"10.1016\/j.tcs.2010.10.043","volume":"412","author":"J Fiala","year":"2011","unstructured":"Fiala, J., Golovach, P.A., Kratochv\u00edl, J.: Parameterized complexity of coloring problems: treewidth versus vertex cover. Theoret. Comput. Sci. 412, 2514\u20132523 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Golovach, P.A., Lokshtanov, D., Saurabh, S.: Clique-width: on the price of generality. In: Proceedings of SODA 2009, pp. 825\u2013834 (2009)","DOI":"10.1137\/1.9781611973068.90"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-28050-4_21","volume-title":"Parameterized and Exact Computation","author":"R Ganian","year":"2012","unstructured":"Ganian, R.: Twin-cover: beyond vertex cover in parameterized algorithmics. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 259\u2013271. Springer, Heidelberg (2012)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. In: Proceedings of STOC, pp. 47\u201363 (1974)","DOI":"10.1145\/800119.803884"},{"key":"2_CR27","unstructured":"Golovach, P.A., Johnson, M., Paulusma, D., Song, J.: A survey on the computational complexity of coloring graphs with forbidden subgraphs, Manuscript. arXiv:1407.1482"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ic.2014.02.004","volume":"237","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Paulusma, D., Song, J.: Closing complexity gaps for coloring problems on H-free graphs. Inf. Comput. 237, 20\u201321 (2014)","journal-title":"Inf. Comput."},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"MC Golumbic","year":"2000","unstructured":"Golumbic, M.C., Rotics, U.: On the clique-width of some perfect graph classes. Int. J. Found. Computer Sci. 11, 423\u2013443 (2000)","journal-title":"Int. J. Found. Computer Sci."},{"key":"2_CR30","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. Discret. Math. 21, 325\u2013356 (1984)","journal-title":"Ann. Discret. Math."},{"key":"2_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"J Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. IWPEC 2004. LNCS, vol. 3162, pp. 162\u2013173. Springer, Heidelberg (2004)"},{"key":"2_CR32","unstructured":"Gy\u00e1rf\u00e1s, A., Kir\u00e1ly, Z., Lehel, J.: On-line competitive coloring algorithms. Technical report TR-9703-1 (1997)"},{"key":"2_CR33","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01206361","volume":"11","author":"A Gy\u00e1rf\u00e1s","year":"1991","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: Effective on-line coloring of $$P_5$$ -free graphs. Combinatorica 11, 181\u2013184 (1991)","journal-title":"Combinatorica"},{"key":"2_CR34","first-page":"168","volume":"29C","author":"A Gy\u00e1rf\u00e1s","year":"1990","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: First fit and on-line chromatic number of families of graphs. Ars Combinatorica 29C, 168\u2013176 (1990)","journal-title":"Ars Combinatorica"},{"key":"2_CR35","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/jgt.3190120212","volume":"12","author":"A Gy\u00e1rf\u00e1s","year":"1988","unstructured":"Gy\u00e1rf\u00e1s, A., Lehel, J.: On-line and first-fit colorings of graphs. J. Graph Theory 12, 217\u2013227 (1988)","journal-title":"J. Graph Theory"},{"key":"2_CR36","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.dam.2013.10.010","volume":"166","author":"PA Golovach","year":"2014","unstructured":"Golovach, P.A., Paulusma, D.: List coloring in the absence of two subgraphs. Discrete Appl. Math. 166, 123\u2013130 (2014)","journal-title":"Discrete Appl. Math."},{"key":"2_CR37","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and Homomorphisms","author":"P Hell","year":"2004","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and Homomorphisms. Oxford Univ, Press (2004)"},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(90)90132-J","volume":"48","author":"P Hell","year":"1990","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: On the complexity of $$H$$ -coloring. J. Comb. Theory Ser. B 48, 92\u2013110 (1990)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2_CR39","unstructured":"Huang, S., Johnson, M., Paulusma, D.: Narrowing the complexity gap for coloring $$(C_s, P_t)$$ -Free Graphs. Comput. J. (to appear)"},{"key":"2_CR40","first-page":"1","volume":"LXII","author":"M Hujter","year":"1993","unstructured":"Hujter, M., Tuza, Z.: Precoloring extension. II. Graph classes related to bipartite graphs. Acta Math. Univ. Comenianae LXII, 1\u201311 (1993)","journal-title":"Acta Math. Univ. Comenianae"},{"key":"2_CR41","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S0963548300001826","volume":"5","author":"M Hujter","year":"1996","unstructured":"Hujter, M., Tuza, Z.: Precoloring extension. III. Classes of perfect graphs. Comb. Probab. Comput. 5, 35\u201356 (1996)","journal-title":"Comb. Probab. Comput."},{"key":"2_CR42","unstructured":"Jansen, K.: Complexity results for the optimum cost chromatic partition problem. Universit\u00e4t Trier, Mathematik\/Informatik, Forschungsbericht, pp. 96\u201341 (1996)"},{"key":"2_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-22953-4_8","volume-title":"Fundamentals of Computation Theory","author":"BMP Jansen","year":"2011","unstructured":"Jansen, B.M.P., Kratsch, S.: Data reduction for graph coloring problems. FCT 2011. LNCS, vol. 6914, pp. 90\u2013101. Springer, Heidelberg (2011)"},{"key":"2_CR44","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0166-218X(96)00085-6","volume":"75","author":"K Jansen","year":"1997","unstructured":"Jansen, K., Scheffler, P.: Generalized coloring for tree-like graphs. Discrete Appl. Math. 75, 135\u2013155 (1997)","journal-title":"Discrete Appl. Math."},{"key":"2_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BFb0029574","volume-title":"Online Algorithms","author":"HA Kierstead","year":"1998","unstructured":"Kierstead, H.A.: Coloring graphs on-line. In: Fiat, A. (ed.) Online Algorithms 1996. LNCS, vol. 1442, pp. 281\u2013305. Springer, Heidelberg (1998)"},{"key":"2_CR46","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/0401048","volume":"1","author":"HA Kierstead","year":"1988","unstructured":"Kierstead, H.A.: The linearity of first-fit coloring of interval graphs. SIAM J. Discrete Math. 1, 526\u2013530 (1988)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR47","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1137\/S0895480192224737","volume":"7","author":"HA Kierstead","year":"1994","unstructured":"Kierstead, H.A., Penrice, S.G., Trotter, W.T.: On-line coloring and recursive graph theory. SIAM J. Discrete Math. 7, 72\u201389 (1994)","journal-title":"SIAM J. Discrete Math."},{"key":"2_CR48","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(02)00198-1","volume":"126","author":"D Kobler","year":"2003","unstructured":"Kobler, D., Rotics, U.: Edge dominating set and colorings on graphs with fixed clique-width. Discrete Appl. Math. 126, 197\u2013221 (2003)","journal-title":"Discrete Appl. Math."},{"key":"2_CR49","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. WG 2001. LNCS, vol. 2204, p. 254. Springer, Heidelberg (2001)"},{"key":"2_CR50","first-page":"139","volume":"62","author":"J Kratochv\u00edl","year":"1993","unstructured":"Kratochv\u00edl, J.: Precoloring extension with fixed color bound. Acta Mathematica Universitatis Comenianae 62, 139\u2013153 (1993)","journal-title":"Acta Mathematica Universitatis Comenianae"},{"key":"2_CR51","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0166-218X(94)90150-3","volume":"50","author":"J Kratochv\u00edl","year":"1994","unstructured":"Kratochv\u00edl, J., Tsuza, Z.: Algorithmic complexity of list colorings. Discrete Appl. Math. 50, 297\u2013302 (1994)","journal-title":"Discrete Appl. Math."},{"key":"2_CR52","unstructured":"Lov\u00e1sz, L.: Coverings and coloring of hypergraphs. In: Proceedings of 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Math, pp. 3\u201312 (1973)"},{"key":"2_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-642-33090-2_61","volume-title":"Algorithms \u2013 ESA 2012","author":"D Kratsch","year":"2012","unstructured":"Kratsch, D., M\u00fcller, H.: Colouring AT-free graphs. ESA 2012. LNCS, vol. 7501, pp. 707\u2013718. Springer, Heidelberg (2012)"},{"key":"2_CR54","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1007\/s00453-008-9233-8","volume":"57","author":"D Marx","year":"2010","unstructured":"Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica 57, 747\u2013768 (2010)","journal-title":"Algorithmica"},{"key":"2_CR55","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.tcs.2005.10.008","volume":"351","author":"D Marx","year":"2006","unstructured":"Marx, D.: Parameterized coloring problems on chordal graphs. Theoret. Comput. Sci. 351, 407\u2013424 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR56","doi-asserted-by":"publisher","first-page":"995","DOI":"10.1016\/j.dam.2005.10.008","volume":"154","author":"D Marx","year":"2006","unstructured":"Marx, D.: Precoloring extension on unit interval graphs. Discrete Appl. Math. 154, 995\u20131002 (2006)","journal-title":"Discrete Appl. Math."},{"key":"2_CR57","unstructured":"Mertzios, G.B., Spirakis, P.G.: Algorithms and almost tight results for 3-colorability of small diameter graphs, Algorithmica (to appear)"},{"key":"2_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1007\/978-3-319-13075-0_41","volume-title":"Algorithms and Computation","author":"P Micek","year":"2014","unstructured":"Micek, P., Wiechert, V.: An on-line competitive algorithm for coloring P8-free bipartite graphs. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 516\u2013527. Springer, Heidelberg (2014)"},{"key":"2_CR59","unstructured":"Micek, P., Wiechert, V.: An on-line competitive algorithm for coloring bipartite graphs without long induced paths, Manuscript. arXiv:1502.00859"},{"key":"2_CR60","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jctb.2014.06.004","volume":"109","author":"M Molloy","year":"2014","unstructured":"Molloy, M., Reed, B.: Colouring graphs when the number of colours is almost the maximum degree. J. Comb. Theory, Ser. B 109, 134\u2013195 (2014)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"2_CR61","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 coloring and forbidden subgraphs - a survey. Graphs Comb. 20, 1\u201340 (2004)","journal-title":"Graphs Comb."},{"key":"2_CR62","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S-L Oum","year":"2006","unstructured":"Oum, S.-L., Seymour, P.D.: Approximating clique-width and branch-width. J. Comb. Theory Ser. B 96, 514\u2013528 (2006)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2_CR63","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/s00453-012-9624-8","volume":"64","author":"J Stacho","year":"2012","unstructured":"Stacho, J.: 3-coloring AT-free graphs in polynomial time. Algorithmica 64, 384\u2013399 (2012)","journal-title":"Algorithmica"},{"key":"2_CR64","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11917496_10","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Y Takenaga","year":"2006","unstructured":"Takenaga, Y., Higashide, K.: Vertex coloring of comparability+ke and \u2013ke graphs. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 102\u2013112. Springer, Heidelberg (2006)"},{"key":"2_CR65","volume-title":"Graph Coloring Problems","author":"B Toft","year":"1995","unstructured":"Toft, B., Jensen, J.R.: Graph Coloring Problems. Wiley, New York (1995)"},{"key":"2_CR66","doi-asserted-by":"publisher","first-page":"2007","DOI":"10.1137\/070710913","volume":"38","author":"Y Villanger","year":"2009","unstructured":"Villanger, Y., Heggernes, P., Paul, C., Telle, J.A.: Interval completion is fixed parameter tractable. SIAM J. Comput. 38, 2007\u20132020 (2009)","journal-title":"SIAM J. Comput."},{"key":"2_CR67","unstructured":"Vizing, V.G.: Coloring the vertices of a graph in prescribed colors. In: Diskret. Analiz., no. 29, Metody Diskret. Anal. v. Teorii Kodov i Shem, vol. 101, pp. 3\u201310 (1976)"},{"key":"2_CR68","doi-asserted-by":"publisher","first-page":"219","DOI":"10.2298\/AADM100812027V","volume":"4","author":"K Vu\u0161kovi\u0107","year":"2010","unstructured":"Vu\u0161kovi\u0107, K.: Even-hole-free graphs: a survey. Appl. Anal. Discrete Math. 4, 219\u2013240 (2010)","journal-title":"Appl. Anal. Discrete Math."},{"key":"2_CR69","unstructured":"de Weijer, P.: Kernelization upper bounds for parameterized graph coloring problems. MSc Thesis, Utrecht University (2013)"},{"key":"2_CR70","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. Discussiones Mathematicae Graph Theory 17, 161\u2013228 (1997)","journal-title":"Discussiones Mathematicae Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53174-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T23:39:08Z","timestamp":1656977948000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53174-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531730","9783662531747"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53174-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"5 August 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Garching","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2015","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2015","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2015","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2015","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}