✦ LIBER ✦

Chronological orderings of interval graphs

✍ Scribed by D. Skrien

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 937 KB
Volume: 8
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(84)90080-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Interval digraphs: An analogue of interv

Interval digraphs: An analogue of interval graphs

✍ S. Das; M. Sen; A. B. Roy; D. B. West 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 728 KB

Intersection digraphs analogous to undirected intersection graphs are introduced. Each vertex is assigned an ordered pair of sets, with a directed edge uu in the intersection digraph when the "source set" of u intersects the "terminal set" of u. Every n-vertex digraph is an intersection digraph of o

Graphs with special neighbourhood orderi

Graphs with special neighbourhood orderings of vertices

✍ Halina Bielak 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 356 KB

LexBFS-orderings and powers of chordal g

LexBFS-orderings and powers of chordal graphs

✍ Andreas Brandstädt; Feodor F. Dragan; Falk Nicolai 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 824 KB

For an undirected graph G the kth power G k of G is the graph with the same vertex set as G where two vertices are adjacent iff their distance is at most k in G. In this paper we prove that any LexBFS-ordering of a chordal graph is a common perfect elimination ordering of all odd powers of this grap