{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:32:18Z","timestamp":1649190738568},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,3,15]],"date-time":"2018-03-15T00:00:00Z","timestamp":1521072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00373-018-1886-8","type":"journal-article","created":{"date-parts":[[2018,3,15]],"date-time":"2018-03-15T15:47:04Z","timestamp":1521128824000},"page":"457-475","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic F-free Coloring of Graphs"],"prefix":"10.1007","volume":"34","author":[{"given":"Piotr","family":"Borowiecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"El\u017cbieta","family":"Sidorowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,15]]},"reference":[{"issue":"166","key":"1886_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0012-365X(97)84217-3","volume":"165","author":"D Achlioptas","year":"1997","unstructured":"Achlioptas, D.: The complexity of $$G$$ G -free colourability. Discret. Math. 165(166), 21\u201330 (1997)","journal-title":"Discret. Math."},{"key":"1886_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0012-365X(89)90196-9","volume":"74","author":"MO Albertson","year":"1989","unstructured":"Albertson, M.O., Jamison, R.E., Hedetniemi, S.T., Locke, S.C.: The subchromatic number of a graph. Discret. Math. 74, 33\u201349 (1989)","journal-title":"Discret. Math."},{"key":"1886_CR3","doi-asserted-by":"publisher","first-page":"2514","DOI":"10.1016\/j.dam.2011.08.016","volume":"160","author":"J Araujo","year":"2012","unstructured":"Araujo, J., Linhares-Sales, C.: On the Grundy number of graphs with few $$P_4$$ P 4 \u2019s. Discret. Appl. Math. 160, 2514\u20132522 (2012)","journal-title":"Discret. Appl. Math."},{"key":"1886_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1142\/S1793830910000747","volume":"2","author":"J-C Bermond","year":"2010","unstructured":"Bermond, J.-C., Havet, F., Huc, F., Linhares-Sales, C.: Improper coloring of weighted grid and hexagonal graphs. Discret. Math. Algorithm Appl. 2, 395\u2013412 (2010)","journal-title":"Discret. Math. Algorithm Appl."},{"key":"1886_CR5","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.dam.2013.12.011","volume":"182","author":"P Borowiecki","year":"2015","unstructured":"Borowiecki, P., Rautenbach, D.: New potential functions for greedy independence and coloring. Discret. Appl. Math. 182, 61\u201372 (2015)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"1886_CR6","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s10878-017-0185-2","volume":"35","author":"P Borowiecki","year":"2018","unstructured":"Borowiecki, P.: Computational aspects of greedy partitioning of graphs. J. Comb. Optim. 35(2), 641\u2013665 (2018). https:\/\/doi.org\/10.1007\/s10878-017-0185-2","journal-title":"J. Comb. Optim."},{"key":"1886_CR7","first-page":"105","volume":"114","author":"P Borowiecki","year":"2012","unstructured":"Borowiecki, P., Sidorowicz, E.: Dynamic coloring of graphs. Fund. Inf. 114, 105\u2013128 (2012)","journal-title":"Fund. Inf."},{"key":"1886_CR8","series-title":"Graph Theory with Applications to Algorithms and Computer Science, (Kalamazoo, 1984)","volume-title":"Generalized Colorings of Graphs","author":"I Broere","year":"1985","unstructured":"Broere, I., Mynhardt, C.M.: Generalized Colorings of Graphs. Graph Theory with Applications to Algorithms and Computer Science, (Kalamazoo, 1984). Wiley, New York (1985)"},{"key":"1886_CR9","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s00453-005-1176-8","volume":"44","author":"H Broersma","year":"2006","unstructured":"Broersma, H., Fomin, F., Kratochv\u00edl, J., Woeginger, G.J.: Planar graph coloring avoiding monochromatic subgraphs: trees and paths make it difficult. Algorithmica 44, 343\u2013361 (2006)","journal-title":"Algorithmica"},{"key":"1886_CR10","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1002\/nav.1033","volume":"48","author":"M Caramia","year":"2001","unstructured":"Caramia, M., Dell\u2019Olmo, P.: Iterative coloring extension of a maximum clique. Naval Res. Log. 48, 518\u2013549 (2001)","journal-title":"Naval Res. Log."},{"key":"1886_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1017\/S0305004100042808","volume":"64","author":"G Chartrand","year":"1968","unstructured":"Chartrand, G., Geller, D., Hedetniemi, S.: A generalization of chromatic number. Proc. Camb. Philos. Soc. 64, 265\u2013271 (1968)","journal-title":"Proc. Camb. Philos. Soc."},{"key":"1886_CR12","series-title":"Discrete Mathematics and its Applications","doi-asserted-by":"publisher","DOI":"10.1201\/9781584888017","volume-title":"Chromatic Graph Theory","author":"G Chartrand","year":"2008","unstructured":"Chartrand, G., Zhang, P.: Chromatic Graph Theory. Discrete Mathematics and its Applications. Chapman and Hall\/CRC Press, Boca Raton (2008)"},{"key":"1886_CR13","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(79)90067-4","volume":"27","author":"CA Christen","year":"1979","unstructured":"Christen, C.A., Selkow, S.M.: Some perfect coloring properties of graphs. J. Combin. Theory Ser. B 27, 49\u201359 (1979)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1886_CR14","doi-asserted-by":"crossref","unstructured":"Chudnovsky, M., Goedgebeur, J., Schaudt, O., Zhong, M.: Obstructions for three-coloring graphs with one forbidden induced subgraph. In: Proceedings of 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201916, pp. 1774\u20131783 (2016)","DOI":"10.1137\/1.9781611974331.ch123"},{"key":"1886_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/jgt.3190100207","volume":"10","author":"L Cowen","year":"1986","unstructured":"Cowen, L., Cowen, R.H., Woodall, D.R.: Defective colorings of graphs in surfaces: partitions into subgraphs of bounded valency. J. Graph Theory 10, 187\u2013195 (1986)","journal-title":"J. Graph Theory"},{"key":"1886_CR16","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1137\/S0895480101395245","volume":"16","author":"J Fiala","year":"2003","unstructured":"Fiala, J., Jansen, K., Le, V.B., Seidel, E.: Graph subcolorings: complexity and algorithms. SIAM J. Discret. Math. 16, 636\u2013650 (2003)","journal-title":"SIAM J. Discret. Math."},{"key":"1886_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0012-365X(03)00177-8","volume":"272","author":"J Gimbel","year":"2003","unstructured":"Gimbel, J., Hartman, C.: Subcolorings and the subchromatic number of a graph. Discret. Math. 272, 139\u2013154 (2003)","journal-title":"Discret. Math."},{"key":"1886_CR18","doi-asserted-by":"publisher","first-page":"3437","DOI":"10.1016\/j.disc.2010.07.011","volume":"310","author":"J Gimbel","year":"2010","unstructured":"Gimbel, J., Ne\u0161et\u0159il, J.: On partitions of graphs into cographs. Discret. Math. 310, 3437\u20133445 (2010)","journal-title":"Discret. Math."},{"key":"1886_CR19","doi-asserted-by":"crossref","unstructured":"Goedgebeur, J., Schaudt, O.: Exhaustive generation of $$k$$ k -critical $${\\cal{H}}$$ H -free graphs. In: Proceedings of Graph-Theoretic Concepts in Computer Science\u201442nd International Workshop, WG\u201916, pp. 109\u2013120 (2016)","DOI":"10.1007\/978-3-662-53536-3_10"},{"key":"1886_CR20","unstructured":"Goyal, N., Vishwanathan, S.: NP-completeness of undirected Grundy numberings and related problems. Unpublished manuscript (1998)"},{"key":"1886_CR21","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1002\/net.20318","volume":"54","author":"F Havet","year":"2009","unstructured":"Havet, F., Kang, R.J., Sereni, J.-S.: Improper coloring of unit disk graphs. Networks 54, 150\u2013164 (2009)","journal-title":"Networks"},{"key":"1886_CR22","first-page":"351","volume":"36","author":"SM Hedetniemi","year":"1982","unstructured":"Hedetniemi, S.M., Hedetniemi, S.T., Beyer, T.: A linear algorithm for the Grundy (coloring) number of a tree. Congr. Numer. 36, 351\u2013363 (1982)","journal-title":"Congr. Numer."},{"key":"1886_CR23","first-page":"109","volume":"4","author":"CT Ho\u00e0ng","year":"2001","unstructured":"Ho\u00e0ng, C.T., Le, V.B.: $$P_4$$ P 4 -free colorings and $$P_4$$ P 4 -bipartite graphs. Discret. Math. Theor. Comput. Sci. 4, 109\u2013122 (2001)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"1886_CR24","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.dam.2014.06.007","volume":"182","author":"CT Ho\u00e0ng","year":"2015","unstructured":"Ho\u00e0ng, C.T., Moore, B., Recoskie, D., Sawada, J., Vatshelle, M.: Constructions of $$k$$ k -critical $$P_5$$ P 5 -free graphs. Discret. Appl. Math. 182, 91\u201398 (2015)","journal-title":"Discret. Appl. Math."},{"key":"1886_CR25","volume-title":"Graph Coloring Problems","author":"TR Jensen","year":"1995","unstructured":"Jensen, T.R., Toft, B.: Graph Coloring Problems. Willey, New Jersey (1995)"},{"key":"1886_CR26","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph Colouring and the Probabilistic Method","author":"MS Molloy","year":"2002","unstructured":"Molloy, M.S., Reed, B.: Graph Colouring and the Probabilistic Method. Algorithms and Combinatorics, vol. 23. Springer, New York (2002)"},{"key":"1886_CR27","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An introduction","author":"MEJ Newman","year":"2010","unstructured":"Newman, M.E.J.: Networks: An introduction. Oxford University Press, Oxford (2010)"},{"key":"1886_CR28","doi-asserted-by":"publisher","first-page":"3166","DOI":"10.1016\/j.disc.2005.06.044","volume":"306","author":"M Zaker","year":"2006","unstructured":"Zaker, M.: Results on the Grundy chromatic number of graphs. Discret. Math. 306, 3166\u20133173 (2006)","journal-title":"Discret. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1886-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1886-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1886-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,12]],"date-time":"2019-10-12T23:43:00Z","timestamp":1570923780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1886-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,15]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1886"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1886-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,15]]},"assertion":[{"value":"26 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 November 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}