Counting interval orders
โ Scribed by P. E. Haxell; J. J. McDonald; S. K. Thomason
- Publisher
- Springer Netherlands
- Year
- 1987
- Tongue
- English
- Weight
- 165 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This paper explores the intimate connection between finite interval graphs and interval orders. Special attention is given to the family of interval orders that agree with, or provide representations of, an interval graph. Two characterizations (one by P. Hanlon) of interval graphs with essentially
We survey recent research on combinatorial properties of interval orders and interval graphs. Topics include: optimization with an uncooperative partner, ramsey trails, sorting with partial information, tree width and graph decompositions, combinatorial extremal problems, shift graphs, Dedekind's en
We characterize the polysemic interval pairs -pairs of posets that admit simultaneous interval and interval-containment representations -and present algorithms to recognize them and construct polysemic interval representations. Mathematics Subject Classifications (1991). 06AO7, 68UO5.