✦ LIBER ✦

Interval graphs and seatching

✍ Scribed by Lefteris M. Kirousis; Christos H. Papadimitriou

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 247 KB
Volume: 55
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(85)90046-9

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

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

Chordal graphs, interval graphs, and wqo

✍ Ding, Guoli 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB 👁 1 views

Let be the induced-minor relation. It is shown that, for every t, all chordal graphs of clique number at most t are well-quasi-ordered by . On the other hand, if the bound on clique number is dropped, even the class of interval graphs is not well-quasi-ordered by .

Interval matroids and graphs

✍ F. Jaeger 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 519 KB

A base of the cycle space of a binary matroid M on E is said to be convex if its elements can be totally ordered in such a way that for every e E E tk set of elements of the base containing e is an interval. \'Ure show that a binary matroid is cographic iff it has a convex base of cycles; equivalent

A relationship between triangulated grap

A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs

✍ Dale J. Skrien 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB 👁 1 views

## Abstract Given a set __F__ of digraphs, we say a graph __G__ is a __F__‐__graph__ (resp., __F__\*‐__graph__) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in __F__. It is proved that all the classes of graphs mentioned in

Random interval graphs

✍ 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