The graph is 2-colorable if and only if there are no confli… Twetch · September 27, 2019 The graph is 2-colorable if and only if there are no conflicts when all vertices are colored.