{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:05:43Z","timestamp":1777539943351,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540735441","type":"print"},{"value":"9783540735458","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_9","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"65-74","source":"Crossref","is-referenced-by-count":14,"title":["Improved Exact Algorithms for Counting 3- and 4-Colorings"],"prefix":"10.1007","author":[{"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serge","family":"Gaspers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/978-3-540-45193-8_6","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O. Angelsmark","year":"2003","unstructured":"Angelsmark, O., Jonsson, P.: Improved Algorithms for Counting Solutions in Constraint Satisfaction Problems. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 81\u201395. Springer, Heidelberg (2003)"},{"issue":"2","key":"9_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.jalgor.2004.06.008","volume":"54","author":"R. Beigel","year":"2005","unstructured":"Beigel, R., Eppstein, D.: 3-coloring in time O(1.3289 n ).. Journal of Algorithms\u00a054(2), 168\u2013204 (2005)","journal-title":"Journal of Algorithms"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Inclusion\u2013Exclusion Algorithms for Counting Set Partitions. In: The Proceedings of FOCS 2006, pp. 575\u2013582 (2006)","DOI":"10.1109\/FOCS.2006.41"},{"key":"9_CR4","unstructured":"Byskov, J.M.: Exact Algorithms for Graph Colouring and Exact Satisfiability. PhD Dissertation (2004)."},{"issue":"6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1016\/j.orl.2004.03.002","volume":"32","author":"J.M. Byskov","year":"2004","unstructured":"Byskov, J.M.: Enumerating Maximal Independent Sets with Applications to Graph Colouring. Operations Research Letters\u00a032(6), 547\u2013556 (2004)","journal-title":"Operations Research Letters"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1093\/comjnl\/14.1.38","volume":"14","author":"N. Christofides","year":"1971","unstructured":"Christofides, N.: An algorithm for the chromatic number of a graph. Computer J.\u00a014, 38\u201339 (1971)","journal-title":"Computer J."},{"issue":"2","key":"9_CR7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.7155\/jgaa.00064","volume":"7","author":"D. Eppstein","year":"2003","unstructured":"Eppstein, D.: Small Maximal Independent Sets and Faster Exact Graph Coloring. J. Graph Algorithms Appl.\u00a07(2), 131\u2013140 (2003)","journal-title":"J. Graph Algorithms Appl."},{"key":"9_CR8","unstructured":"Fomin, F.V., Gaspers, S., Saurabh, S., Stepanov, A.A.: On Two Techniques of Combining Branching and Treewidth. Report No 337, Department of Informatics, University of Bergen, Norway (December 2006)"},{"issue":"5","key":"9_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ipl.2005.10.012","volume":"97","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., H\u00f8ie, K.: Pathwidth of cubic graphs and exact algorithms. Information Processing Letters\u00a097(5), 191\u2013196 (2006)","journal-title":"Information Processing Letters"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1998.1587","volume":"57","author":"U. Feige","year":"1998","unstructured":"Feige, U., Kilian, J.: Zero Knowledge and the Chromatic Number. Journal of Computer and System Sciences\u00a057(2), 187\u2013199 (1998)","journal-title":"Journal of Computer and System Sciences"},{"key":"9_CR11","unstructured":"F\u00fcrer, M., Kasiviswanathan, S.P.: Algorithms for counting 2-SAT solutions and colorings with applications. In: ECCC\u00a033 (2005)"},{"key":"9_CR12","volume-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness.","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco, CA (1979)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/11786986_21","volume-title":"Automata, Languages and Programming","author":"S. Khot","year":"2006","unstructured":"Khot, S., Ponnuswami, A.K.: Better Inapproximability Results for MaxClique, Chromatic Number and Min-3Lin-Deletion. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 226\u2013237. Springer, Heidelberg (2006)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Koivisto, M.: An O(2 n ) algorithm for graph coloring and other partitioning problems via inclusion-exclusion. In: Proceedings of FOCS 2006, pp. 583\u2013590 (2006)","DOI":"10.1109\/FOCS.2006.11"},{"issue":"3","key":"9_CR15","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0020-0190(76)90065-X","volume":"5","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: A Note on the Complexity of the Chromatic Number. Information Processing Letters\u00a05(3), 66\u201367 (1976)","journal-title":"Information Processing Letters"},{"issue":"3","key":"9_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1016\/j.jda.2005.12.009","volume":"4","author":"B. Monien","year":"2006","unstructured":"Monien, B., Preis, R.: Upper bounds on the bisection width of 3- and 4-regular graphs. Discrete Algorithms\u00a04(3), 475\u2013498 (2006)","journal-title":"Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:18:05Z","timestamp":1619518685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}