1. Alon, N., Friedland, S.: The maximum number of perfect matchings in graphs with a given degree sequence. Electron. J. Comb. 15, N13 (2008)
2. Alon, N., Rödl, V., Rucinski, A.: Perfect matchings in ϵ-regular graphs. Electron. J. Comb. 5, R13 (1998)
3. Beigel, R., Eppstein, D.: 3-coloring in time O(1.3289 n ). J. Algorithms 54, 168–204 (2005)
4. Bessy, S., Havet, F.: Enumerating the edge-colourings and total colourings of a regular graph. J. Comb. Optim. (2012). doi: 10.1007/s10878-011-9448-5
5. Björklund, A., Husfeldt, T.: Inclusion–exclusion algorithms for counting set partitions. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 575–582. IEEE, New York (2006)