Skip to Main content Skip to Navigation
Journal articles

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

Abstract : 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/hal-00959035
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Submitted on : Thursday, March 13, 2014 - 5:08:07 PM
Last modification on : Sunday, November 4, 2018 - 7:54:02 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:17:05 PM

File

dm070110.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00959035, version 1

Collections

Citation

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, DMTCS, 2005, 7, pp.141-154. ⟨hal-00959035⟩

Share

Metrics

Record views

167

Files downloads

838