Funder
National Science Foundation
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference9 articles.
1. 3-coloring in time O(1.3289n);Beigel;J. Alg.,2005
2. Set partitioning via inclusion–exclusion;Björklund;SIAM J. Comput.,2009
3. An algorithm for the chromatic number of a graph;Christofides;Comput. J.,1971
4. Small maximal independent sets and faster exact graph coloring;Eppstein;J. Graph Algorithms Appl.,2003
5. Improved exact algorithms for counting 3- and 4-colorings;Fomin,2007