✦ LIBER ✦

Lower bounds for planar orthogonal drawings of graphs

✍ Scribed by Roberto Tamassia; Ioannis G. Tollis; Jeffrey Scott Vitter

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 743 KB
Volume: 39
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90059-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Monotone drawings of planar graphs

✍ János Pach; Géza Tóth 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB

## Abstract Let __G__ be a graph drawn in the plane so that its edges are represented by __x__‐monotone curves, any pair of which cross an even number of times. We show that __G__ can be redrawn in such a way that the __x__‐coordinates of the vertices remain unchanged and the edges become non‐cross

Homomorphism bounds for oriented planar

Homomorphism bounds for oriented planar graphs

✍ T. H. Marshall 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

## Abstract If ${\cal C}$ is a class of oriented graphs (directed graphs without opposite arcs), then an oriented graph is a __homomorphism bound__ for ${\cal C}$ if there is a homomorphism from each graph in ${\cal C}$ to __H__. We find some necessary conditions for a graph to be a homomorphism bo

An algorithm for drawing planar graphs

✍ Bor Plestenjak 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 382 KB 👁 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s

Upper and lower bounds for stochastic ma

Upper and lower bounds for stochastic marked graphs

✍ Sergio Rajsbaum 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 457 KB

A lower bound for groupies in graphs

✍ Mackey, John 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 2 views

A non-isolated vertex of a graph G is called a groupie if the average degree of the vertices connected to it is larger than or equal to the average degree of the vertices in G. An isolated vertex is a groupie only if all vertices of G are isolated. While it is well known that every graph must contai

A lower bound for area-universal graphs

✍ Gianfranco Bilardi; Shiva Chaudhuri; Devdatt Dubhashi; K. Mehlhorn 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 525 KB