A. Bjöklund, T. Husfeld, and M. Koivisto, ? ?) n ) algorithm for some ? > 0, Some (hard?) open questions Minimum vertex coloring in O ? (2 n ), 2006.

S. Bessy and F. Havet, Enumerating the edge-colourings WGTC, pp.2012-2051

A. Bjöklund, T. Husfeld, and M. Koivisto, ? ?) n ) algorithm for some ? > 0, Conclusion Some (hard?) open questions Minimum vertex coloring in O ? (2 n ), 2006.

S. Bessy and F. Havet, Enumerating the edge-colourings WGTC, pp.2012-2051

A. Bjöklund, T. Husfeld, and M. Koivisto, ? ?) n ) algorithm for some ? > 0, Conclusion Some (hard?) open questions Minimum vertex coloring in O ? (2 n ), 2006.

S. Bessy and F. Havet, Enumerating the edge-colourings WGTC, p.2012