General theoretical results on rectilinear embedability of graphs |
| |
Authors: | Yanpei Liu A Morgana B Simeone |
| |
Institution: | (1) Institute of Applied Mathematics & Institute of Mathematics, Academia Sinica, China;(2) Università di Roma La Sapienza , Italy |
| |
Abstract: | In the design of certain kinds of electronic circuits the following question arises: given a non-negative integerk, what graphs admit of a plane embedding such that every edge is a broken line formed by horizontal and vertical segments and having at mostk bends? Any such graph is said to bek-rectilinear. No matter whatk is, an obvious necessary condition fork-rectilinearity is that the degree of each vertex does not exceed four. Our main result is that every planar graphH satisfying this condition is 3-rectilinear: in fact, it is 2-rectilinear with the only exception of the octahedron. We also outline a polynomial-time algorithm which actually constructs a plane embedding ofH with at most 2 bends (3 bends ifH is the octahedron) on each edge. The resulting embedding has the property that the total number of bends does not exceed 2n, wheren is the number of vertices ofH. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|