On the computational complexity of defining sets Original Research Article

Suppose we have a family image of sets. For every image, a set image is a defining set for image if S is the only element of image that contains D as a subset. This concept has been studied in numerous cases, such as vertex colorings, perfect matchings, dominating sets, block designs, geodetics, orientations, and Latin squares.