✦ LIBER ✦

Interval representations of planar graphs

✍ Scribed by Carsten Thomassen

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 867 KB
Volume: 40
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(86)90061-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Homogeneously representable interval gra

Homogeneously representable interval graphs

✍ Dale Skrien; John Gimbel 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 258 KB

## We characterize those interval graphs G with the property that, for every vertex u, there exists an interval represention of G in which the interval representing 21 is the left-most (or right-most) interval in the representation.

On the homogeneous representation of int

On the homogeneous representation of interval graphs

✍ Stephan Olariu 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

## Abstract An interval graph __G__ is homogeneously representable if for every vertex __v__ of __G__ there exists an interval representation of __G__ with __v__ corresponding to an end interval. We show that the homogeneous representation of interval graphs is rooted in a deeper property of a clas

Rectangular and visibility representatio

Rectangular and visibility representations of infinite planar graphs

✍ Carsten Thomassen 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 75 KB

## Abstract We provide a new method for extending results on finite planar graphs to the infinite case. Thus a result of Ungar on finite graphs has the following extension: Every infinite, planar, cubic, cyclically 4‐edge‐connected graph has a representation in the plane such that every edge is a h

Interval Space Representation of interva

Interval Space Representation of interval Structures

✍ P. Ney 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 274 KB

An algorithm for straight-line represent

An algorithm for straight-line representation of simple planar graphs

✍ Lin Woo 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 841 KB

An algorithm is developed for drawing straight-line planar graphs which are isomorphic to a convex polyhedron and simple (i.e. a connected graph with no self-loops or multiple branches). The construction of such graphs is outlined in three stages. Stage 1 determines all the independent cycles of the

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