? ?) n ) algorithm for some ? > 0, Some (hard?) open questions Minimum vertex coloring in O ? (2 n ), 2006. ,
Enumerating the edge-colourings WGTC, pp.2012-2051 ,
? ?) n ) algorithm for some ? > 0, Conclusion Some (hard?) open questions Minimum vertex coloring in O ? (2 n ), 2006. ,
Enumerating the edge-colourings WGTC, pp.2012-2051 ,
? ?) n ) algorithm for some ? > 0, Conclusion Some (hard?) open questions Minimum vertex coloring in O ? (2 n ), 2006. ,
Enumerating the edge-colourings WGTC, p.2012 ,