The Complexity of Some Edge Deletion Problems

Ehab S. El-Mallah, Charles J. Colbourn

Research output: Contribution to journalArticle

42 Scopus citations

Abstract

The edge deletion problem (EDP) corresponding to a given class H of graphs is to find the minimum number of edges whose deletion from a given graph G results in a subgraph G', G' - H. In this paper we extend previous complexity results by showing that the EDP corresponding to any class H of graphs in each of the following cases is NP-hard. (i) H is defined by a set of forbidden homeomorphs or minors in which every member is a 2-connected graph with minimum degree 3. (ii) H is defined by K4 — e as a forbidden homeomorph or minor. (iii) H is defined by Pl, l - 3, the simple path on l nodes, as a forbidden induced subgraph.

Original languageEnglish (US)
Pages (from-to)354-362
Number of pages9
JournalIEEE transactions on circuits and systems
Volume35
Issue number3
DOIs
StatePublished - Mar 1988
Externally publishedYes

ASJC Scopus subject areas

  • Engineering(all)

Cite this