3-coloring in time, Journal of Algorithms, vol.54, issue.2, pp.168-204, 2005. ,
DOI : 10.1016/j.jalgor.2004.06.008
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
Narrow sieves for parameterized paths and packings, Journal of Computer and System Sciences, 2010. ,
DOI : 10.1016/j.jcss.2017.03.003
Graph theory, Graduate Texts in Mathematics, vol.244, 2008. ,
DOI : 10.1007/978-1-84628-970-5
Computing an st-numbering, Theoretical Computer Science, vol.2, issue.3, p.339344, 1976. ,
DOI : 10.1016/0304-3975(76)90086-4
Corrigendum: Computing an st-numbering, Theoretical Computer Science, vol.4, issue.1, p.123, 1977. ,
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
Computers and intractability. A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences, 1979. ,
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
The NP-completeness of edge-colouring, SIAM J. Computing, vol.2, pp.225-231, 1981. ,
Graph coloring problems. Wiley-Interscience Series in Discrete Mathematics and Optimization, 1995. ,
The art of Computer Programming, Combinatorial Algorithms, Part, vol.4, issue.1, 2011. ,
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.4934
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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.84.6110
An algorithm for planarity testing of graphs, Proceedings of the International Symposium on the Theory of Graphs, pp.215-232, 1966. ,
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