𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Counting endpoint sequences for interval orders and interval graphs

✍ Scribed by Alexander Belfer; Martin C. Golumbic

Book ID
118319650
Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
1014 KB
Volume
114
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Interval graphs and interval orders
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

Combinatorial Aspects of Interval Orders
Combinatorial Aspects of Interval Orders and Interval Graphs
✍ 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

Comparability graphs with constraint, pa
Comparability graphs with constraint, partial semi-orders and interval orders
✍ Claude Flament πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 580 KB

A symmetric, anfireflexive relation S is a comparability graph ff one can assign a transitive orientation to the edges: we obtain a partial order. We say that S is a comparability graph with constraint C, a subrelation of S, if S has a transitive orientation including C. A characterization is given