Generation and enumeration of some classes of interval orders
From MaRDI portal
Publication:2376909
Recommendations
Cites work
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1033382 (Why is no real title available?)
- scientific article; zbMATH DE number 2107707 (Why is no real title available?)
- scientific article; zbMATH DE number 6157245 (Why is no real title available?)
- (2+2)-free posets, ascent sequences and pattern avoiding permutations
- A characterization of \((3+1)\)-free posets
- A linear time and space algorithm to recognize interval orders
- An obvious proof of Fishburn's interval order theorem
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- Counting interval orders
- ECO:a methodology for the enumeration of combinatorial objects
- ENUMERATION OF CHORD DIAGRAMS AND AN UPPER BOUND FOR VASSILIEV INVARIANTS
- Generating functions for generating trees
- Height counting of unlabeled interval and \(N\)-free posets.
- Interval graphs and interval orders
- Interval orders based on weak orders
- Intransitive Indifference in Preference Theory: A Survey
- Intransitive indifference with unequal indifference intervals
- The On-Line Encyclopedia of Integer Sequences
- Vassiliev invariants and a strange identity related to the Dedekind eta-function
Cited in
(5)
This page was built for publication: Generation and enumeration of some classes of interval orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2376909)