A Note on Undirected Graphs Realizable as P.O. Sets
Canadian mathematical bulletin, Tome 13 (1970) no. 3, pp. 371-374
Voir la notice de l'article provenant de la source Cambridge
Let (P, ≥) be a p.o. set. The basis graph of (P, ≥) is defined to be the directed graph whose vertex set is P and in which the ordered pair 〈a, b〉 is an edge if and only if b covers a in (P, ≥).Let D be a directed graph. All graphs considered in this note are finite and are free of loops and multiple edges.
Haff, C. E.; Murty, U. S. R.; Wilton, R. C. A Note on Undirected Graphs Realizable as P.O. Sets. Canadian mathematical bulletin, Tome 13 (1970) no. 3, pp. 371-374. doi: 10.4153/CMB-1970-070-6
@article{10_4153_CMB_1970_070_6,
author = {Haff, C. E. and Murty, U. S. R. and Wilton, R. C.},
title = {A {Note} on {Undirected} {Graphs} {Realizable} as {P.O.} {Sets}},
journal = {Canadian mathematical bulletin},
pages = {371--374},
year = {1970},
volume = {13},
number = {3},
doi = {10.4153/CMB-1970-070-6},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1970-070-6/}
}
TY - JOUR AU - Haff, C. E. AU - Murty, U. S. R. AU - Wilton, R. C. TI - A Note on Undirected Graphs Realizable as P.O. Sets JO - Canadian mathematical bulletin PY - 1970 SP - 371 EP - 374 VL - 13 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1970-070-6/ DO - 10.4153/CMB-1970-070-6 ID - 10_4153_CMB_1970_070_6 ER -
%0 Journal Article %A Haff, C. E. %A Murty, U. S. R. %A Wilton, R. C. %T A Note on Undirected Graphs Realizable as P.O. Sets %J Canadian mathematical bulletin %D 1970 %P 371-374 %V 13 %N 3 %U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1970-070-6/ %R 10.4153/CMB-1970-070-6 %F 10_4153_CMB_1970_070_6
Cité par Sources :