# Node-Deletion NP-Complete Problems

@article{Krishnamoorthy1979NodeDeletionNP,
title={Node-Deletion NP-Complete Problems},
author={M. S. Krishnamoorthy and N. Deo},
journal={SIAM J. Comput.},
year={1979},
volume={8},
pages={619-625}
}
• Published 1979
• Mathematics, Computer Science
• SIAM J. Comput.
• The entire class of node-deletion problems can be stated as follows: Given a graph G, find the minimum number of nodes to be deleted so that the remaining subgraph g satisfies a specified property $\pi$. For each $\pi$, a distinct node-deletion problem arises. The various deletion problems considered here are for the following properties: each component of g is (i) null, (ii) complete, (iii) a tree, (iv) nonseparable, (v) planar, (vi) acyclic, (vii) bipartite, (viii) transitive, (ix… CONTINUE READING