Lattices with Doubly Irreducible Elements
From MaRDI portal
Publication:4044634
DOI10.4153/CMB-1974-016-3zbMATH Open0293.06003MaRDI QIDQ4044634FDOQ4044634
(35)
- 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
- Basic retracts and counting of lattices
- Chromatic classification of dismantlable lattices
- Homotopy type of posets and lattice complementation
- Ordonnés escamotables et points fixes. (Dismantlable orders and fixed points)
- Reducibility in finite posets
- Lattices with constraints for the sublattices
- Interval-dismantling for lattices
- Varieties generated by lattices of breadth two
- Binary set systems and totally balanced hypergraphs
- Totally Balanced Formal Context Representation
- A proof of Frankl's union-closed sets conjecture for dismantlable lattices
- Perfect non-commuting graphs of matrices over chains
- Reducible classes of finite lattices
- Parsimonious cluster systems
- A structure theory for ordered sets
- On the length of the lattice of sublattices of a finite distributive lattice
- Zur Topologie der Fahnenräume: Definition und Fragestellungen
- Combinatorial inequalities for semimodular lattices of breadth two
- Maximal Sublattices of Finite Distributive Lattices. II
- Covering energy of some classes of posets
- Planar lattices are lexicographically shellable
- Crown-free lattices and their related graphs
- Reducibility number
- On the grading numbers of direct products of chains
- Obituary: Ivan Rival
- Perfect zero-divisor graphs
- Drawing orders with few slopes
- On the Galois Lattice of Bipartite Distance Hereditary Graphs
- Incomparability graphs of dismantable lattices
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)
