On strongly planar not-all-equal 3SAT

@article{Dehghan2016OnSP,
  title={On strongly planar not-all-equal 3SAT},
  author={Ali Dehghan},
  journal={J. Comb. Optim.},
  year={2016},
  volume={32},
  pages={721-724}
}
In this paper we show that there is a polynomial time algorithm for the strongly planar not-all-equal 3SAT problem. Also, we prove that a restricted version of planar not-all-equal 3SAT is NP-complete and in consequence of this result, we show that for a given planar bipartite graph G, deciding whether there is a vertexlabeling by gap from {1, 2} such that the induced proper coloring is a proper vertex 2-coloring is NP-complete.