| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10328481 | Discrete Applied Mathematics | 2005 | 10 Pages |
Abstract
We give a new, inductive proof that every 2-connected planar graph is a bar-visibility graph. Changing from horizontal lines to arcs of concentric circles and from vertical to radial visibility, we obtain a similar result for polar visibility graphs, which naturally embed on the projective plane.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Joan P. Hutchinson,