New results on generalized graph coloring.
Alekseev, Vladimir E.; Farrugia, Alastair; Lozin, Vadim V.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2004)
- Volume: 6, Issue: 2, page 215-221
- ISSN: 1365-8050
Access Full Article
topHow to cite
topAlekseev, Vladimir E., Farrugia, Alastair, and Lozin, Vadim V.. "New results on generalized graph coloring.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 6.2 (2004): 215-221. <http://eudml.org/doc/124356>.
@article{Alekseev2004,
author = {Alekseev, Vladimir E., Farrugia, Alastair, Lozin, Vadim V.},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {Generalized graph coloring; Polynomial algorithm; NP-completeness},
language = {eng},
number = {2},
pages = {215-221},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {New results on generalized graph coloring.},
url = {http://eudml.org/doc/124356},
volume = {6},
year = {2004},
}
TY - JOUR
AU - Alekseev, Vladimir E.
AU - Farrugia, Alastair
AU - Lozin, Vadim V.
TI - New results on generalized graph coloring.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2004
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 6
IS - 2
SP - 215
EP - 221
LA - eng
KW - Generalized graph coloring; Polynomial algorithm; NP-completeness
UR - http://eudml.org/doc/124356
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.