1. D. Eppstein, Improved algorithms for 3-coloring, 3-edge-coloring and constraint satisfaction, in: Proc. 12th ACM–SIAM Symp. on Discrete Algorithms (SODA 2001), Washington, DC, pp. 329–337.
2. Computers and Intractability. A Guide to the Theory of NP-completeness;Garey,1979
3. An n5/2 algorithm for matching in bipartite graphs;Hopcroft;SIAM J. Comput.,1975
4. A special planar satisfiability problem and some consequences of its NP-completeness;Kratochvı́l;Discrete Appl. Math.,1994
5. Planar formulae and their uses;Lichtenstein;SIAM J. Comput.,1982