AbstractThe number of unlabeled 2-dimensional posets is recursively calculated. This counting makes use of the relationship between permutations and posets of dimension two. © 1994.
|Keywords||unlabeled , 2-dimensional, posets, counting , permutations||Issue Date||5-Aug-1994||Journal||Discrete Mathematics||URI||http://research.asu.edu.eg/123456789/1125||DOI||1-3
Recommend this item
Items in Ain Shams Scholar are protected by copyright, with all rights reserved, unless otherwise indicated.