1983/06/01 by Dwight Duffus, Ivan Rival · 8 citations
Computer Science · Mathematics · #Advanced Algebra and Logic #Rough Sets and Fuzzy Logic #Combinatorics #Distributive property #Mathematics #Indifference graph #Comparability graph #Discrete mathematics #Hypercube #Graph #Chordal graph #1-planar graph #Pure mathematics
paper · doi:10.2307/2044697
published in Proceedings of the American Mathematical Society 88(2), 197 (American Mathematical Society)
openalex publication_date 1983/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/30
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.