Q. consider the following problem:
a) Eulerian path
b) 2- SAT
c) Constraint reachibilty
d)graph coloring
number of problem which is polynomial solvable??
i am get only b (2-SAT) somy answer is 1 but answer given 2 here also eulerian path ?? how to appraoch these type of question Plz explain??