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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the visualization of graphs. Prentice Hall, Upper Saddle River, NJ, 1999.
A. M. Dean. Bar-visibility graphs on the Möbius band. Manuscript, 1999.
A. M. Dean and J. P. Hutchinson. Rectangle-visibility representations of bipartite graphs. Discrete Applied Math., 75:9–25, 1997.
A. M. Dean and J. P. Hutchinson. Rectangle-visibility of unions and products of trees. J. Graph Algorithms and Applications, 2:1–21, 1998.
A. M. Dean and J. P. Hutchinson. Rectangle-visibility graphs on surfaces. Manuscript, 1999.
S. Even and R. E. Tarjan. Computing an st-numbering. Theoret. Comput. Sci., 2:339–344, 1976.
J. P. Hutchinson. On polar visibility representations of graphs. In: Proc. Graph Drawing 2000, J. Marks, ed., to appear.
J. P. Hutchinson, T. Shermer, and A. Vince. On representations of some thickness two graphs (extended abstract). In: Lecture Notes in Computer Science #1027, F. Brandenburg, ed., Springer, Berlin, 159–166, 1995.
B. Mohar and P. Rosenstiehl. Tessellation and visibility representations of maps on the torus. Discrete Comput. Geom., 19:249–263, 1998.
R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1:321–341, 1986.
R. Tamassia and I. G. Tollis. Tessellation representations of planar graphs. In: Proc. 27th Annual Allerton Conf., University of Illinois at Urbana-Champaign, 48–57, 1989.
R. Tamassia and I. G. Tollis. Representations of graphs on a cylinder. SIAM J. Disc. Math., 4:139–149, 1991.
A. White. Graphs, Groups and Surfaces (revised ed.). North-Holland, Amsterdam, 1984.
S. K. Wismath. Characterizing bar line-of-sight graphs. In: Proc. 1st ACM Symp. Comput. Geom., 147–152, 1985.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dean, A.M. (2001). A Layout Algorithm for Bar-Visibility Graphs on the Möbius Band. In: Marks, J. (eds) Graph Drawing. GD 2000. Lecture Notes in Computer Science, vol 1984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44541-2_33
Download citation
DOI: https://doi.org/10.1007/3-540-44541-2_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41554-1
Online ISBN: 978-3-540-44541-8
eBook Packages: Springer Book Archive