Graphs and finite distributive partial lattices
Median graphs constitute a well-known and widely studied class of graphs; see for example the papers [\textit{H. J. Bandelt} and \textit{J. Hedlikova}, Discrete Math. 45, 1-30 (1983; Zbl 0506.06005)] and \textit{H. J. Bandelt} and \textit{H. M. Mulder}, J. Graph Theory 7, 487-497 (1983; Zbl 0525.05055)] and the references therein. They constitute a subclass of the Hasse diagram graphs of distributive partial lattices. In this paper we give a characterization for the Hasse diagram graphs G of finite distributive partial lattices by means of prime convexes of G. This characterization generalizes that of Mulder and Schrijver for median graphs reprinted in [the first cited paper, Theorem 2.2].
- Simple congruence lattices of finite graphs
- Orthocomplemented complete lattices and graphs
- A study of algorithms relating distributive lattices, median graphs, and Formal Concept Analysis
- scientific article; zbMATH DE number 1604039 (Why is no real title available?)
- Retracts of hypercubes
- scientific article; zbMATH DE number 949392 (Why is no real title available?)
- Distributive lattices with strong endomorphism kernel property as direct sums
- scientific article; zbMATH DE number 5492072 (Why is no real title available?)
- GRAPH COMPONENTS AND DYNAMICS OVER FINITE FIELDS
- Median graphs, parallelism and posets
This page was built for publication: Graphs and finite distributive partial lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122593)
