On the algorithmic complexity of twelve covering and independence parameters of graphs
Twelve parameters related to covering of vertices and/or edges by vertices and/or edges, and to independence, are identified in a uniform framework. Known results on these parameters are surveyed, focusing on complexity results. Several new NP-completeness results are established.
scientific article; zbMATH DE number 1271071
scientific article