Geodesic
Bound graph polysemy
The electronic journal of combinatorics, Tome 7 (2000)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Bound polysemy is the property of any pair $(G_1, G_2)$ of graphs on a shared vertex set $V$ for which there exists a partial order on $V$ such that any pair of vertices has an upper bound precisely when the pair is an edge in $G_1$ and a lower bound precisely when it is an edge in $G_2$. We examine several special cases and prove a characterization of the bound polysemic pairs that illuminates a connection with the squared graphs.
DOI : 10.37236/1521
Classification : 05C62, 06A07
Mots-clés : Hasse diagram, comparability graph, bound graph, polysemy 
@article{10_37236_1521,
     author = {Paul J. Tanenbaum},
     title = {Bound graph polysemy},
     journal = {The electronic journal of combinatorics},
     year = {2000},
     volume = {7},
     doi = {10.37236/1521},
     zbl = {0953.05055},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1521/}
}
TY  - JOUR
AU  - Paul J. Tanenbaum
TI  - Bound graph polysemy
JO  - The electronic journal of combinatorics
PY  - 2000
VL  - 7
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1521/
DO  - 10.37236/1521
ID  - 10_37236_1521
ER  - 
%0 Journal Article
%A Paul J. Tanenbaum
%T Bound graph polysemy
%J The electronic journal of combinatorics
%D 2000
%V 7
%U http://geodesic.mathdoc.fr/articles/10.37236/1521/
%R 10.37236/1521
%F 10_37236_1521
Paul J. Tanenbaum. Bound graph polysemy. The electronic journal of combinatorics, Tome 7 (2000). doi: 10.37236/1521

Cité par Sources :