Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs.
Nikolopoulos, Stavros D.; Palios, Leonidas
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (2006)
- Volume: 8, Issue: 1, page 65-82
- ISSN: 1365-8050
Access Full Article
top
How to cite
topNikolopoulos, Stavros D., and Palios, Leonidas. "Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 8.1 (2006): 65-82. <http://eudml.org/doc/129521>.
@article{Nikolopoulos2006,
author = {Nikolopoulos, Stavros D., Palios, Leonidas},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {recognition problem; perfect graphs; recognition algorithm; HH-free graphs; HHD-free graphs; WPO-graphs},
language = {eng},
number = {1},
pages = {65-82},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs.},
url = {http://eudml.org/doc/129521},
volume = {8},
year = {2006},
}
TY - JOUR
AU - Nikolopoulos, Stavros D.
AU - Palios, Leonidas
TI - Recognizing HH-free, HHD-free, and Welsh-Powell opposition graphs.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 2006
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 8
IS - 1
SP - 65
EP - 82
LA - eng
KW - recognition problem; perfect graphs; recognition algorithm; HH-free graphs; HHD-free graphs; WPO-graphs
UR - http://eudml.org/doc/129521
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.