✦ LIBER ✦

Random interval graphs

✍ Scribed by E. R. Scheinerman

Publisher: Springer-Verlag
Year: 1988
Tongue: English
Weight: 663 KB
Volume: 8
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf02189092

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Nicholas Pippenger 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

We consider models for random interval graphs that are based on stochastic service systems, with vertices corresponding to customers and edges corresponding to pairs of customers that are in the system simultaneously. The number N of vertices in a connected component thus corresponds to the number o

On the interval number of random graphs

✍ Edward R. Scheinerman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 309 KB

The asymptotic probability that a random

The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph

✍ Joel E. Cohen 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 431 KB

Open-interval graphs versus closed-inter

Open-interval graphs versus closed-interval graphs

✍ P. Frankl; H. Maehara 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 218 KB

A graph G = (V, E) is said to be represented by a family F of nonempty sets if there is a bijection f:V--\*F such that uv ~E if and only iff(u)Nf(v)q=~. It is proved that if G is a countable graph then G can be represented by open intervals on the real line if and only if G can be represented by clo

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

Recognizing edge clique graphs among int

Recognizing edge clique graphs among interval graphs and probe interval graphs

✍ Jing Kong; Yaokun Wu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 250 KB

The edge clique graph of a graph H is the one having the edge set of H as vertex set, two vertices being adjacent if and only if the corresponding edges belong to a common complete subgraph of H . We characterize the graph classes {edge clique graphs} ∩ {interval graphs} as well as {edge clique grap