{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T06:35:54Z","timestamp":1780382154008,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540875307","type":"print"},{"value":"9783540875314","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_25","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"339-353","source":"Crossref","is-referenced-by-count":7,"title":["On Counting Generalized Colorings"],"prefix":"10.1007","author":[{"given":"T.","family":"Kotek","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. A.","family":"Makowsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Zilber","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0095-8956(02)00006-0","volume":"87","author":"N. Alon","year":"2003","unstructured":"Alon, N., Ding, G., Oporowski, B., Vertigan, D.: Partitioning into graphs with only small components. Journal of Combinatorial Theory, Series B\u00a087, 231\u2013243 (2003)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"25_CR2","volume-title":"Algebraic Graph Theory","author":"N. Biggs","year":"1993","unstructured":"Biggs, N.: Algebraic Graph Theory, 2nd edn. Cambridge University Press, Cambridge (1993)","edition":"2"},{"key":"25_CR3","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1999","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer, Heidelberg (1999)"},{"key":"25_CR4","unstructured":"Courcelle, B., Godlin, B., Makowsky, J.A.: Towards a theory of graph polynomials, I: Second order definable polynomials (in preparation, 2007)"},{"key":"25_CR5","unstructured":"Courcelle, B.: A multivariate interlace polynomial (December 2006) (preprint)"},{"key":"25_CR6","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"1996","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics. Springer, Heidelberg (1996)"},{"key":"25_CR7","doi-asserted-by":"crossref","DOI":"10.1142\/5814","volume-title":"Chromatic Polynomials and Chromaticity of Graphs","author":"F.M. Dong","year":"2005","unstructured":"Dong, F.M., Koh, K.M., Teo, K.L.: Chromatic Polynomials and Chromaticity of Graphs. World Scientific, Singapore (2005)"},{"key":"25_CR8","series-title":"London Math. Soc. Lecture Note Ser","first-page":"13","volume-title":"Survey in Combinatorics","author":"K. Edwards","year":"1997","unstructured":"Edwards, K.: The harmonious chromatic number and the achromatic number. In: Bailey, R.A. (ed.) Survey in Combinatorics. London Math. Soc. Lecture Note Ser, vol.\u00a0241, pp. 13\u201347. Cambridge Univ. Press, Cambridge (1997)"},{"key":"25_CR9","series-title":"Perspectives in Mathematical Logic","volume-title":"Finite Model Theory","author":"H.D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Heidelberg (1995)"},{"key":"25_CR10","series-title":"Undergraduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2355-7","volume-title":"Mathematical Logic","author":"H.D. Ebbinghaus","year":"1994","unstructured":"Ebbinghaus, H.D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Undergraduate Texts in Mathematics. Springer, Heidelberg (1994)","edition":"2"},{"issue":"2-3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0166-218X(94)00100-R","volume":"57","author":"K. Edwards","year":"1995","unstructured":"Edwards, K., McDiarmid, C.: The complexity of harmonious colouring for trees. Discrete Appl. Math.\u00a057(2-3), 133\u2013144 (1995)","journal-title":"Discrete Appl. Math."},{"key":"25_CR12","volume-title":"Algebraic Combinatorics","author":"C.D. Godsil","year":"1993","unstructured":"Godsil, C.D.: Algebraic Combinatorics. Chapman and Hall, Boca Raton (1993)"},{"key":"25_CR13","first-page":"453","volume":"26","author":"F. Harary","year":"1967","unstructured":"Harary, F., Hedetniemi, S., Rins, G.: An interpolation theorem for graphical homomorphisms. Portugal. Math.\u00a026, 453\u2013462 (1967)","journal-title":"Portugal. Math."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1137\/0604032","volume":"4","author":"J.E. Hopcroft","year":"1983","unstructured":"Hopcroft, J.E., Krishnamoorthy, M.S.: On the harmonious coloring of graphs. SIAM J. Algebraic Discrete Methods\u00a04, 306\u2013311 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"25_CR15","first-page":"27","volume":"19","author":"F. Hughes","year":"1997","unstructured":"Hughes, F., MacGillivray, G.: The achromatic number of graphs: a survey and some new results. Bull. Inst. Combin. Appl.\u00a019, 27\u201356 (1997)","journal-title":"Bull. Inst. Combin. Appl."},{"key":"25_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Linial, N., Matou\u0161ek, J., Sheffet, O., Tardos, G.: Graph coloring with no large monochromatic components (2007) arXiv:math\/0703362v1","DOI":"10.1016\/j.endm.2007.07.020"},{"issue":"1-3","key":"25_CR18","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.apal.2003.11.002","volume":"126","author":"J.A. Makowsky","year":"2004","unstructured":"Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught theorem. Annals of Pure and Applied Logic\u00a0126(1-3), 159\u2013213 (2004)","journal-title":"Annals of Pure and Applied Logic"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/11780342_35","volume-title":"Logical Approaches to Computational Barriers","author":"J.A. Makowsky","year":"2006","unstructured":"Makowsky, J.A.: From a zoo to a zoology: Descriptive complexity for graph polynomials. In: Beckmann, A., Berger, U., L\u00f6we, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol.\u00a03988, pp. 330\u2013341. Springer, Heidelberg (2006)"},{"key":"25_CR20","unstructured":"Makowsky, J.A., Zilber, B.: Polynomial invariants of graphs and totally categorical theories. MODNET Preprint No. 21 (2006), \n                      http:\/\/www.logique.jussieu.fr\/modnet\/Publications\/Preprint%20server"},{"key":"25_CR21","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.5802\/aif.1706","volume":"49","author":"S.D. Noble","year":"1999","unstructured":"Noble, S.D., Welsh, D.J.A.: A weighted graph polynomial from chromatic invariants of knots. Ann. Inst. Fourier, Grenoble\u00a049, 1057\u20131087 (1999)","journal-title":"Ann. Inst. Fourier, Grenoble"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Sokal, A.: The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In: Survey in Combinatorics, 2005. London Mathematical Society Lecture Notes, vol.\u00a0327, pp. 173\u2013226 (2005)","DOI":"10.1017\/CBO9780511734885.009"},{"key":"25_CR23","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(92)90369-Q","volume":"100","author":"S. Toda","year":"1992","unstructured":"Toda, S., Watanabe, O.: Polynomial time 1-Turing reductions from #PH to #P. Theor. Comp. Sc.\u00a0100, 205\u2013221 (1992)","journal-title":"Theor. Comp. Sc."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:13:53Z","timestamp":1715058833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}