N. Alon and S. Friedland, The maximum number of perfect matchings in graphs with a given degree sequence, Electr. J. Comb, vol.15, p.13, 2008.

R. Beigel and D. Eppstein, 3-coloring in time, Journal of Algorithms, vol.54, issue.2, pp.168-204, 2005.
DOI : 10.1016/j.jalgor.2004.06.008

A. Björklund and T. Husfeldt, Inclusion--Exclusion Algorithms for Counting Set Partitions, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.575-582, 2006.
DOI : 10.1109/FOCS.2006.41

A. Björklund, T. Husfeldt, P. Kaski, and M. Koivisto, Narrow sieves for parameterized paths and packings, Journal of Computer and System Sciences, 2010.
DOI : 10.1016/j.jcss.2017.03.003

A. Björklund, T. Husfeldt, and M. Koivisto, Set Partitioning via Inclusion-Exclusion, SIAM Journal on Computing, vol.39, issue.2, pp.546-563, 2009.
DOI : 10.1137/070683933

J. A. Bondy and U. S. Murty, Graph theory, Graduate Texts in Mathematics, vol.244, 2008.
DOI : 10.1007/978-1-84628-970-5

L. M. Bregman, Some properties of nonnegative matrices and their permanents, Soviet Math. Dokl, vol.14, pp.945-949, 1973.

S. Even and R. E. Tarjan, Computing an st-numbering, Theoretical Computer Science, vol.2, issue.3, pp.339-344, 1976.
DOI : 10.1016/0304-3975(76)90086-4

S. Even and R. E. Tarjan, Corrigendum: Computing an st-numbering, Theoretical Computer Science, vol.4, issue.1, p.123, 1977.

F. V. Fomin, S. Gaspers, and S. Saurabh, Improved Exact Algorithms for Counting 3- and 4-Colorings, Lecture Notes in Computer Science, vol.4598, pp.65-74, 2007.
DOI : 10.1007/978-3-540-73545-8_9

M. R. Garey and D. S. Johnson, Computers and intractability. A guide to the theory of NPcompleteness . A Series of Books in the Mathematical Sciences, 1979.

P. A. Golovach, D. Kratsch, and J. F. Couturier, Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds, Proceedings of WG 2010, pp.39-50, 2010.
DOI : 10.1006/jagm.1996.0061
URL : https://hal.archives-ouvertes.fr/hal-00942919

I. Holyer, The NP-completeness of edge-colouring, SIAM J. Computing, vol.2, pp.225-231, 1981.

T. R. Jensen and B. Toft, Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization, 1995.

D. E. Knuth, The art of Computer Programming, Combinatorial Algorithms, Part, vol.4, issue.1, 2011.

M. Koivisto, An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.583-590, 2006.
DOI : 10.1109/FOCS.2006.11

L. Kowalik, Improved edge-coloring with three colors, Theoretical Computer Science, vol.410, issue.38-40, pp.3733-3742, 2009.
DOI : 10.1016/j.tcs.2009.05.005

A. Lempel, S. Even, and I. Cederbaum, An algorithm for planarity testing of graphs, Proceedings of the International Symposium on the Theory of Graphs, pp.215-232, 1966.

A. Sánchez-arroyo, Determining the total colouring number is np-hard, Discrete Mathematics, vol.78, issue.3, pp.315-319, 1989.
DOI : 10.1016/0012-365X(89)90187-8