✦ LIBER ✦

Drawing graphs on rectangular grids

✍ Scribed by Markus Schäffter

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 889 KB
Volume: 63
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00020-e

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Box-Rectangular Drawings of Plane Graphs

✍ Md.Saidur Rahman; Shin-ichi Nakano; Takao Nishizeki 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 413 KB

In this paper we introduce a new drawing style of a plane graph G called a box-rectangular drawing. It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, a

How to draw a planar graph on a grid

✍ H. Fraysseix; J. Pach; R. Pollack 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 652 KB

Grid Drawings of 4-Connected Plane Graph

Grid Drawings of 4-Connected Plane Graphs

✍ K. Miura; S. Nakano; T. Nishizeki 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 322 KB

Upward Three-Dimensional Grid Drawings o

Upward Three-Dimensional Grid Drawings of Graphs

✍ Vida Dujmović; David R. Wood 📂 Article 📅 2006 🏛 Springer Netherlands 🌐 English ⚖ 579 KB

A linear-time algorithm for drawing a pl

A linear-time algorithm for drawing a planar graph on a grid

✍ M. Chrobak; T.H. Payne 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 523 KB

Doubly eulerian trails on rectangular gr

Doubly eulerian trails on rectangular grids

✍ J. L. Brenner; R. C. Lyndon 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 317 KB

Let K be the 1-skeleton of the regular tessellation of Euclidean n-space by n-cubes, n 2 2. We show that K admits a doubly Eulerian trail (simply Eulerian trai/),that is,.a doubly infinite path 7~ = 1.. e-,e,e, where, out of each pair {e, e -' } of oppositely directed edges, both (exactly one) appea