We show that the problems of deciding (i) whether an arbitrary graph h
as a k-regular subgraph, for some given k greater than or equal to 3,
(ii) whether a planar graph has a quartic subgraph, and (iii) whether
a planar graph has a quintic subgraph, are complete for NP via logspac
e reductions. There are no regular planar graphs of degree greater tha
n 5.