A finite ordered set is upper levellable iff it has a diagram in which, for each element, all upper covers of the element are on the same horizontal level. In this note, we give a method for computing a canonical upper levelling, should one exist.
Citation
Michael S.Roddy. A Note on Orders With Level Diagrams[J], Ars Combinatoria, Volume 053. 219-224. .
