A layout algorithm for bar-visibility graphs on the möbius band

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We characterize two types of bar-visibility graphs on the Möbius band (abbreviated “BVGMs”), in which vertices correspond to intervals that are parallel or orthogonal to the axis of the band, depending on type, and in which adjacency corresponds to orthogonal visibility of intervals. BVGMs with intervals orthogonal to the axis are shown to be equivalent to the “polar visibility graphs” studied by Hutchinson [7]. BVGMs with intervals parallel to the axis are characterized as those graphs G which satisfy the following conditions: G is embedded on the Möbius band; the block-cutpoint tree of G is a caterpillar in which all but at most one block is planar; and the non-planar block, if it exists, is at the “head” of the caterpillar.

Cite

CITATION STYLE

APA

Dean, A. M. (2001). A layout algorithm for bar-visibility graphs on the möbius band. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1984, pp. 350–359). Springer Verlag. https://doi.org/10.1007/3-540-44541-2_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free