𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Polyhedral aspects of partial orders and comparability graphs

✍ Scribed by Samuel Fiorini

Book ID
108497945
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
55 KB
Volume
2
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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