You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Graphs Orientable as Distributive Lattices
Dwight Duffus and Ivan Rival
Proceedings of the American Mathematical Society
Vol. 88, No. 2 (Jun., 1983), pp. 197-200
Published by: American Mathematical Society
Stable URL: http://www.jstor.org/stable/2044697
Page Count: 4
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
There are two types of graphs commonly associated with finite (partially) ordered sets: the comparability graph and the covering graph. While the first type has been characterized, only partial descriptions of the second are known. We prove that the covering graphs of distributive lattices are precisely those graphs which are retracts of hypercubes.
Proceedings of the American Mathematical Society © 1983 American Mathematical Society