5 citations · 7 across the 8 of their papers we have counts for
1 paper · 2 filters
Sangxia Huang
We prove that for sufficiently large K, it is NP-hard to color K-colorable graphs with less than 2^{K^{1/3}} colors. This improves the previous result of K versus K^{O(log K)} in K…