fixed-parameter tractable when parameterized by both the size of the dominating set and the size of the smallest forbidden complete bipartite subgraph; that is, the problem is FPT on biclique-free graphs, a very general class of sparse graphs that includes the planar graphs. The complementary set to a dominating set, a nonblocker, can be found by a fixed-parameter algorithm on any graph. See also Vizing's conjecture - relates the domination number of a cartesian product of graphs to the domination number of its factors. Set cover problem Bondage number Nonblocker - the complement of a dominating set. Notes References . . . . . . . . . , p. 190, problem GT2. . . . . . . . Further reading . . . . . Graph theory objects NP-complete problems Computational problems in graph theory