April 01, 1980 article Open access The node-deletion problem for hereditary properties is NP-complete Journal of Computer and System Sciences DOI: 10.1016/0022-0000(80)90060-4 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 518 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access The complexity of blocking all solutions 2026 Theoretical Computer Science article Computer Science Complexity and Algorithms in Graphs Open access 1 citations The Advice Complexity of Delayed F-Node-Deletion Problems and of Disconnected Delayed H-Edge-Deletion Problems 2024 SSRN Electronic Journal preprint Computer Science Advanced Graph Theory Research Open access 0 citations 2 results References 0