This is a preview. Log in through your library . Abstract We prove that the edge dominating set problem for graphs is NP-complete even when restricted to planar or bipartite graphs of maximum degree 3 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback