1. Lecture Notes in Artificial Intelligence;O. Angelsmark,2005
2. Bax, E.T.: Inclusion and exclusion algorithm for the Hamiltonian Path problem. Inf. Process. Lett. 47(4), 203–207 (1993)
3. Björklund, A., Husfeldt, T. Koivisto, M.: Set partitioning via inclusion–exclusion. SIAM J. Comput., to appear. Prelim. versions in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, Berkeley, CA, 21–24 October 2006, pp. 575–582, 583–590. IEEE Computer Society, Los Alamitos, CA (2006)
4. Bodlaender, H., Kratsch, D.: An exact algorithm for graph coloring with polynomial memory. Technical report UU-CS-2006-015, Utrecht University (2006)
5. Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32, 547–556 (2004)