On Polar Visibility Representations of Graphs

Hutchinson, Joan P. (2001) On Polar Visibility Representations of Graphs. In: Graph Drawing 8th International Symposium, GD 2000, September 20–23, 2000 , pp. 63-76(Official URL: http://dx.doi.org/10.1007/3-540-44541-2_7).

This is the latest version of this item.

Full text not available from this repository.

Abstract

We introduce polar visibility graphs, graphs whose vertices can be represented by arcs of concentric circles with adjacency determined by radial visibility including visibility through the origin. These graphs are more general than the well-studied bar-visibility graphs and are characterized here, when arcs are proper subsets of circles, as the graphs that embed on the plane with all but at most one cut-vertex on a common face or on the projective plane with all cut-vertices on a common face. We also characterize the graphs representable using full circles and arcs.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-44541-2_7
Classifications: M Methods > M.999 Others
G Algorithms and Complexity > G.490 Embeddings
P Styles > P.900 Visibility
P Styles > P.999 Others
URI: http://gdea.informatik.uni-koeln.de/id/eprint/305

Available Versions of this Item

Actions (login required)

View Item View Item