Bound graph polysemy.
The Electronic Journal of Combinatorics [electronic only] (2000)
- Volume: 7, Issue: 1, page Research paper R43, 12 p.-Research paper R43, 12 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topTanenbaum, Paul J.. "Bound graph polysemy.." The Electronic Journal of Combinatorics [electronic only] 7.1 (2000): Research paper R43, 12 p.-Research paper R43, 12 p.. <http://eudml.org/doc/120723>.
@article{Tanenbaum2000,
author = {Tanenbaum, Paul J.},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {Hasse diagram; comparability graph; bound graph; polysemy},
language = {eng},
number = {1},
pages = {Research paper R43, 12 p.-Research paper R43, 12 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Bound graph polysemy.},
url = {http://eudml.org/doc/120723},
volume = {7},
year = {2000},
}
TY - JOUR
AU - Tanenbaum, Paul J.
TI - Bound graph polysemy.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2000
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 7
IS - 1
SP - Research paper R43, 12 p.
EP - Research paper R43, 12 p.
LA - eng
KW - Hasse diagram; comparability graph; bound graph; polysemy
UR - http://eudml.org/doc/120723
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.