Generation and enumeration of some classes of interval orders
From MaRDI portal
Publication:2376909
DOI10.1007/s11083-012-9269-xzbMath1282.06004WikidataQ60692018 ScholiaQ60692018MaRDI QIDQ2376909
Filippo Disanto, Elisa Pergola, Simone Rinaldi, Renzo Pinzani
Publication date: 26 June 2013
Published in: Order (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11083-012-9269-x
06A07: Combinatorics of partially ordered sets
Related Items
Catalan pairs and Fishburn triples, Hereditary semiorders and enumeration of semiorders by dimension
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An obvious proof of Fishburn's interval order theorem
- A linear time and space algorithm to recognize interval orders
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- Interval graphs and interval orders
- Counting interval orders
- Generating functions for generating trees
- Height counting of unlabeled interval and \(N\)-free posets.
- Interval orders based on weak orders
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Intransitive indifference with unequal indifference intervals
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- ECO:a methodology for the enumeration of combinatorial objects
- Intransitive Indifference in Preference Theory: A Survey
- A characterization of \((3+1)\)-free posets
- Vassiliev invariants and a strange identity related to the Dedekind eta-function
