Transversals of Vertex Partitions in Graphs
Michael R. Fellows · SIAM Journal on Discrete Mathematics · 1990
This paper studies graph properties of the following forms: For every partition of the vertex set that satisfies an upper (or lower) bound on the number of elements in each partition class, there is a transversal of the partition that is an independent (or dominating) set. A possible application to fault-tolerant data storage is discussed, and bounds for the parameters that are functions of minimum and maximum degree are established. The complexity of associated decision problems is also addressed.