Planar lattices are lexicographically shellable
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- Cohen-Macaulay quotients of polynomial rings
- Combinatorics and commutative algebra
- Efficient Planarity Testing
- Finite lattices and Jordan-Hölder sets
- Interval graphs and interval orders
- Lattices with Doubly Irreducible Elements
- Laying Out Graphs Using Queues
- On the dimension of partially ordered sets
- Partial orders of dimension 2
- Planar Lattices
- Planar lattices and planar graphs
- Shellable and Cohen-Macaulay Partially Ordered Sets
- Which Spheres are Shellable?
Cited in
(11)- On planar and dismantlable lattices
- Cartesian lattice counting by the vertical 2-sum
- Edgewise Cohen-Macaulay connectivity of partially ordered sets
- The lexicographic sum of Cohen-Macaulay and shellable ordered sets
- The distinguishing number and distinguishing chromatic number for posets
- A shellable poset that is not lexicographically shellable
- Plane graphs and Cohen-Macaulay posets
- On the Cohen-Macaulay connectivity of supersolvable lattices and the homotopy type of posets
- The Frobenius complex.
- A note on the homology of signed posets
- A note about shellable planar posets
This page was built for publication: Planar lattices are lexicographically shellable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1198483)