A note about shellable planar posets
From MaRDI portal
Recommendations
Cited in
(10)- A Dynkin diagram classification theorem arising from a combinatorial problem
- Planar lattices are lexicographically shellable
- Decompositions of partially ordered sets
- Shellable posets arising from the even subgraphs of a graph
- Shellability of face posets of electrical networks and the CW poset property
- Shellability of posets of labeled partitions and arrangements defined by root systems
- scientific article; zbMATH DE number 1944633 (Why is no real title available?)
- Shellability of the higher pinched Veronese posets
- Notes on acyclic orientations and the shelling lemma
- On Cohen-Macaulay posets of dimension two and permutation graphs
This page was built for publication: A note about shellable planar posets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4928226)
