Representing a concept lattice by a graph. (English summary) Discrete Appl. Math. 144 (2004), no. 1-2, 27–42. Summary: “Concept lattices (also called Galois lattices) are an ordering of the maximal rectangles defined by a binary relation. In this paper, we present a new relationship between lattices and graphs: given a binary relation R, we define an underlying graph GR, and establish a one-to-one correspondence between the set of elements of the concept lattice of R and the set of minimal separators of GR. We explain how to use the properties of minimal separators to define a sublattice
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.