Interval orders and circle orders
โ Scribed by P. C. Fishburn
- Publisher
- Springer Netherlands
- Year
- 1988
- Tongue
- English
- Weight
- 376 KB
- Volume
- 5
- 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
Let d!= {P, , . . . . P,} be a family of sets. A partial order P(@, <) on CD is naturally defined by the condition P, < 5 iff P, is contained in 4. When the elements of Cg are disks (i.e. circles together with their interiors), P(@, <) is called a circle order; if the elements of Cg are n-polygons,