2-Colorable Perfect Matching is NP-complete in 2-Connected 3-Regular Planar Graphs. - Erik D. Demaine; Kritkorn Karntikoon; Nipun Pitimanaaree (Theory Comput. Syst., 2025)