1 paper
Erik D. Demaine, Kritkorn Karntikoon, Nipun Pitimanaaree
The 2-colorable perfect matching problem asks whether a graph can be colored with two colors so that each node has exactly one neighbor with the same color as itself. We prove that…