๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Interval orders and circle orders
โœ P. C. Fishburn ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 376 KB
Interval graphs and interval orders
โœ Peter C. Fishburn ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 949 KB

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

Interval orders based on weak orders
โœ Kenneth P. Bogart; Joseph Bonin; Jutta Mitas ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 338 KB
Combinatorial Aspects of Interval Orders
โœ William T. Trotter ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 28 KB

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

Simultaneous representation of interval
โœ Paul J. Tanenbaum ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 658 KB

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.