We know that the clique problem is NP-complete. Is the restriction of the problem to bipartite graphs or planar graphs still NP-complete?
Is the clique problem NP-complete also on bipartite or planar graphs?
complexity theory;graph theory;graphs;np complete