P

Initializing...

THEOREM 2, p. 367 — the edge dominating set problem for bipartite graphs of maximum degree 3 is NP-complete · Prove2Me