Article ID Journal Published Year Pages File Type
9512197 Discrete Mathematics 2005 13 Pages PDF
Abstract
Some posets of binary leaf-labeled trees are shown to be supersolvable lattices and explicit EL-labelings are given. Their characteristic polynomials are computed, recovering their known factorization in a different way.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Supersolvable LL-lattices of binary trees
Authors
, ,