On P4-tidy graphs.
Giakoumakis, V.; Roussel, F.; Thuillier, H.
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] (1997)
- Volume: 1, Issue: 1, page 17-41
- ISSN: 1365-8050
Access Full Article
top
How to cite
topGiakoumakis, V., Roussel, F., and Thuillier, H.. "On P4-tidy graphs.." Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only] 1.1 (1997): 17-41. <http://eudml.org/doc/120093>.
@article{Giakoumakis1997,
author = {Giakoumakis, V., Roussel, F., Thuillier, H.},
journal = {Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]},
keywords = {modular decomposition; perfect graphs},
language = {eng},
number = {1},
pages = {17-41},
publisher = {Maison de l'Informatique et des Mathématiques Discrètes, MIMD},
title = {On P4-tidy graphs.},
url = {http://eudml.org/doc/120093},
volume = {1},
year = {1997},
}
TY - JOUR
AU - Giakoumakis, V.
AU - Roussel, F.
AU - Thuillier, H.
TI - On P4-tidy graphs.
JO - Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
PY - 1997
PB - Maison de l'Informatique et des Mathématiques Discrètes, MIMD
VL - 1
IS - 1
SP - 17
EP - 41
LA - eng
KW - modular decomposition; perfect graphs
UR - http://eudml.org/doc/120093
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.