Geodesic
Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
Discrete mathematics & theoretical computer science, Tome 7 (2005).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2005_7_a3,
     author = {Abbas, Nesrine and Culberson, Joseph and Stewart, Lorna},
     title = {Recognizing {Maximal} {Unfrozen} {Graphs} with respect to {Independent} {Sets} is {CO-NP-complete}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {7},
     year = {2005},
     doi = {10.46298/dmtcs.345},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.345/}
}
TY  - JOUR
AU  - Abbas, Nesrine
AU  - Culberson, Joseph
AU  - Stewart, Lorna
TI  - Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - 7
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.345/
DO  - 10.46298/dmtcs.345
LA  - en
ID  - DMTCS_2005_7_a3
ER  - 
%0 Journal Article
%A Abbas, Nesrine
%A Culberson, Joseph
%A Stewart, Lorna
%T Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
%J Discrete mathematics & theoretical computer science
%D 2005
%V 7
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.345/
%R 10.46298/dmtcs.345
%G en
%F DMTCS_2005_7_a3
Abbas, Nesrine; Culberson, Joseph; Stewart, Lorna. Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete. Discrete mathematics & theoretical computer science, Tome 7 (2005). doi : 10.46298/dmtcs.345. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.345/

Cité par Sources :