Sciweavers

6 search results - page 2 / 2
» An approximate version of Hadwiger's conjecture for claw-fre...
Sort
View
APPROX
2009
Springer
126views Algorithms» more  APPROX 2009»
13 years 11 months ago
Improved Inapproximability Results for Maximum k-Colorable Subgraph
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
Venkatesan Guruswami, Ali Kemal Sinop