Is the maximum independent set in cubic planar graphs NP-complete?
A complete NP-completeness proof for this problem is given right after Theorem 4.1 in the following paper.


  Bojan Mohar:
  "Face Covers and the Genus Problem for Apex Graphs"
  Journal of Combinatorial Theory, Series B 82, 102-117 (2001)