What is the minimum vertex cover on k-regular graphs, for fixed k>2 NP-hard proof?

I am aware that the minimum (cardinality) vertex cover problem on cubic graphs (i.e., 3-regular) graphs is NP-hard. Say positive integer k>2 is fixed. Has there been any computational...

19 January 2015 7,599 2 View