✦ LIBER ✦

At most single-bend embeddings of cubic graphs

✍ Scribed by Liu Yanpei; P. Marchioro; R. Petreschi

Book ID: 112818126
Publisher: SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year: 1994
Tongue: English
Weight: 701 KB
Volume: 9
Category: Article
ISSN: 1005-1031
DOI: 10.1007/bf02662066

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Theoretical results on at most 1-bend em

Theoretical results on at most 1-bend embeddability of graphs

✍ Yanpei Liu; Paola Marchioro; Rossella Petreschi; Bruno Simeone 📂 Article 📅 1992 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 300 KB

Straight line embeddings of cubic planar

Straight line embeddings of cubic planar graphs with integer edge lengths

✍ Jim Geelen; Anjie Guo; David McKinnon 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB

## Abstract We prove that every simple cubic planar graph admits a planar embedding such that each edge is embedded as a straight line segment of integer length. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:270‐274, 2008

Embeddings of Star Graphs into Optical M

Embeddings of Star Graphs into Optical Meshes without Bends

✍ Stefan Thomas Obenaus; Ted H. Szymanski 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 377 KB

We show an embedding of the star graph into a rectangular optical multichannel mesh of d dimensions such that the embedding has no bends; that is, neighbors in the star graph always differ in exactly one coordinate in the mesh, to facilitate one-hop optical communication. To embed an n-star, the mes

An algorithm for 1-bend embeddings of pl

An algorithm for 1-bend embeddings of plane graphs in the two-dimensional grid

✍ Aurora Morgana; Célia Picinin de Mello; Giovanna Sontacchi 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 491 KB

In this paper we characterize the class of plane graphs that can be embedded on the twodimensional grid with at most one bend on each edge. In addition, we provide an algorithm that either detects a forbidden conÿguration or generates an embedding with at most one bend on each edge.

An algorithm for 1-bend embeddings of pl

An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid

✍ Aurora Morgana; Célia Picinin de Mello; Giovanna Sontacchi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Graphs of separability at most 2

✍ Ferdinando Cicalese; Martin Milanič 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 288 KB