Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2005

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete

Résumé

A graph is unfrozen with respect to k independent set if it has an independent set of size k after the addition of any edge. The problem of recognizing such graphs is known to be NP-complete. A graph is maximal if the addition of one edge means it is no longer unfrozen. We designate the problem of recognizing maximal unfrozen graphs as MAX(U(k-SET)) and show that this problem is CO-NP-complete. This partially fills a gap in known complexity cases of maximal NP-complete problems, and raises some interesting open conjectures discussed in the conclusion.
Fichier principal
Vignette du fichier
dm070110.pdf (122.6 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00959035 , version 1 (13-03-2014)

Identifiants

Citer

Nesrine Abbas, Joseph Culberson, Lorna Stewart. Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. Discrete Mathematics and Theoretical Computer Science, 2005, Vol. 7, pp.141-154. ⟨10.46298/dmtcs.345⟩. ⟨hal-00959035⟩

Collections

TDS-MACS
69 Consultations
904 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More