Four fundamental graph problems, Minimum vertex cover, Max imum independent set, Minimum dominating set and Maximum cut, are shown to be APX-complete even for cubic graphs. This means that unless P=NP these problems do not admit any polynomial t i e approximation scheme on input graphs of degree bounded by three.