Cited in
(41)- Incomparability graphs of dismantable lattices
- On the Galois lattice of bipartite distance hereditary graphs
- Covering energy of posets and its bounds
- Posets dismantlable by doubly irreducibles
- Lattices with many congruences are planar
- Lattice diagrams with few slopes
- Purely chromatic and hyper chromatic lattices
- Homotopy type of posets and lattice complementation
- Counting of lattices on up to three reducible elements
- Basic retracts and counting of lattices
- Chromatic classification of dismantlable lattices
- Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points)
- Reducibility in finite posets
- Equivalence of labeled graphs and lattices
- Lattices with constraints for the sublattices
- Counting of lattices containing up to 5 reducible elements and having nullity up to 3
- Varieties generated by lattices of breadth two
- Interval-dismantling for lattices
- Binary set systems and totally balanced hypergraphs
- A proof of Frankl's union-closed sets conjecture for dismantlable lattices
- Totally Balanced Formal Context Representation
- Dimension of RC-lattices
- Perfect non-commuting graphs of matrices over chains
- Parsimonious cluster systems
- Reducible classes of finite lattices
- A structure theory for ordered sets
- Counting of lattices containing up to four comparable reducible elements and having nullity up to three
- Combinatorial inequalities for semimodular lattices of breadth two
- Zur Topologie der Fahnenräume: Definition und Fragestellungen
- On the length of the lattice of sublattices of a finite distributive lattice
- Planar lattices are lexicographically shellable
- Crown-free lattices and their related graphs
- Covering energy of some classes of posets
- Maximal Sublattices of Finite Distributive Lattices. II
- Reducibility number
- On the grading numbers of direct products of chains
- Perfect zero-divisor graphs
- Obituary: Ivan Rival
- Drawing orders with few slopes
- Counting of lattices having nullity up to two
- On the Galois Lattice of Bipartite Distance Hereditary Graphs
This page was built for publication: Lattices with Doubly Irreducible Elements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044634)
