Bound graph polysemy.
Tanenbaum, Paul J.
The Electronic Journal of Combinatorics [electronic only], Tome 7 (2000), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2000-01-01
EUDML-ID : urn:eudml:doc:120723 
@article{01488945,
     title = {Bound graph polysemy.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {7},
     year = {2000},
     zbl = {0953.05055},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01488945}
}

Tanenbaum, Paul J. Bound graph polysemy.. The Electronic Journal of Combinatorics [electronic only], Tome 7 (2000) . http://gdmltest.u-ga.fr/item/01488945/