Abstract
This paper investigates links between some classes of graphs and some classes of lattices. We show that a co-atomic lattice is crown-free (i.e. dismantlable) if and only if it is a maximal clique lattice of a strongly chordal graph. We also prove that each crown-free lattice that is not a chain contains at least two incomparable doubly-irreducible elements x1 and x2 such that ↑ x1 and ↑ x2 are chains.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
