Share  Bookmark

 Download from




 Funded by

[1] A. Bulatov. The complexity of the counting constraint satisfaction problem. J. ACM, 60(5):34:134:41, 2013.
[2] A. Bulatov and V. Dalmau. Towards a dichotomy theorem for the counting constraint satisfaction problem. Inform. Comput., 205(5):651678, 2007.
[3] M. Chudnovsky. Berge trigraphs and their applications. PhD thesis, Princeton University, 2003.
[4] M. Dyer and C. Greenhill. The complexity of counting graph homomorphisms. Random Struct. Algorithms, 17(34):260289, 2000.
[5] T. Feder, P. Hell, S. Klein, and R. Motwani. Complexity of graph partition problems. In Proc. 31st ACM Symposium on Theory of Computing (STOC 1999), pages 464472. ACM, 1999.
[6] T. Feder, P. Hell, S. Klein, and R. Motwani. List partitions. SIAM J. Discrete Math., 16(3):449478, 2003.
[7] A. G¨obel, L. A. Goldberg, C. McQuillan, D. Richerby, and T. Yamakami. Counting list matrix partitions of graphs. In Proc. 29th Conference on Computational Complexity (CCC 2014), pages 5665. IEEE, 2014. Full version: ArXiv CoRR abs/1306.5176.
[8] P. Hell, M. Hermann, and M. Nevisi. Counting partitions of graphs. In Proc. 23rd International Symposium on Algorithms and Computation (ISAAC 2012), volume 7676 of LNCS, pages 227236. Springer, 2012.
[9] P. Hell and J. Neˇsetˇril. Counting list homomorphisms and graphs with bounded degrees. In J. Neˇsetˇril and P. Winkler, editors, Graphs, Morphisms and Statistical Physics, volume 63 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 105112, 2004.
[10] P. Hell and J. Neˇsetˇril. Graphs and Homomorphisms. Oxford University Press, 2004.