Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete.
Abbas, N.; Culberson, J.; Stewart, L.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2005)
- Volume: 7, Issue: 1, page 141-153
- ISSN: 1365-8050
Access Full Article
top
How to cite
topAbbas, N., Culberson, J., and Stewart, L.. "Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 7.1 (2005): 141-153. <http://eudml.org/doc/129518>.
@article{Abbas2005,
author = {Abbas, N., Culberson, J., Stewart, L.},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {unfrozen graph; independent set; graph recognition},
language = {eng},
number = {1},
pages = {141-153},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete.},
url = {http://eudml.org/doc/129518},
volume = {7},
year = {2005},
}
TY - JOUR
AU - Abbas, N.
AU - Culberson, J.
AU - Stewart, L.
TI - Recognizing maximal unfrozen graphs with respect to independent sets is CO-NP-complete.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2005
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 7
IS - 1
SP - 141
EP - 153
LA - eng
KW - unfrozen graph; independent set; graph recognition
UR - http://eudml.org/doc/129518
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.