On Polar Visibility Representations of Graphs

  • Hutchinson Joan P. 
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2265)


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.


Planar Graph Full Circle Visibility Graph Klein Bottle Empty Interior 
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.


  1. 1.
    Bose, P., Dean, A., Hutchinson, J., Shermer, T. On rectangle visibility graphs In: North, S. (ed.): Proc. Graph Drawing’96. Lecture Notes in Computer Science, Vol. 1190. Springer, Berlin (1997) 25–44Google Scholar
  2. 2.
    Chang, Y-W., Jacobson, M. S., Lehel, J., West, D. B. The visibility number of a graph (preprint)Google Scholar
  3. 3.
    Dean, A., Hutchinson, J. Rectangle-visibility representations of bipartite graphs Discrete Applied Math. 75 (1997) 9–25MATHMathSciNetGoogle Scholar
  4. 5.
    Dean, A. Bar-visibility graphs on the Möbius Band In: Marks, J. (ed.): Proc. Graph Drawing 2000. (to appear)Google Scholar
  5. 6.
    Hutchinson, J., Shermer, T., Vince, A. On Representations of some Thickness-two graphs Computational Geometry, Theory and Applications 13 (1999) 161–171MATHMathSciNetGoogle Scholar
  6. 7.
    Mohar, B. Projective planarity in linear time J. Algorithms 15(1993) 482–502MATHMathSciNetGoogle Scholar
  7. 8.
    Mohar, B., Rosenstiehl, P. Tessellation and visibility representations of maps on the torus Discrete Comput. Geom. 19 (1998) 249–263MATHMathSciNetGoogle Scholar
  8. 9.
    Mohar, B., Thomassen, C. Graphs on Surfaces Johns Hopkins Press (to appear)Google Scholar
  9. 10.
    O’Rourke, J. Art Gallery Theorems and Algorithms Oxford University Press, Oxford (1987)Google Scholar
  10. 11.
    Tamassia, R., Tollis, I. G. A unified approach to visibility representations of planar graphs Discrete and Computational Geometry 1 (1986) 321–341MATHMathSciNetGoogle Scholar
  11. 12.
    Tesselation representations of planar graphs In: Medanic, J. V., Kumar, P. R. (eds.): Proc. 27th Annual Allerton Conf. on Communication, Control, and Computing. (1989) 48–57Google Scholar
  12. 14.
    Thomassen, C. Planar representations of graphs In: Bondy, J. A., Murty, U. S. R. (eds.): Progress in Graph Theory. (1984) 43–Google Scholar
  13. 15.
    West, D. Introduction to Graph Theory Prentice Hall, Upper Saddle River, NJ (1996)MATHGoogle Scholar
  14. 16.
    White, A. Graphs, Groups and Surfaces revised ed. North-Holland, Amsterdam (1984)Google Scholar
  15. 17.
    Wismath, S. Characterizing bar line-of-sight graphs In: Proc. 1st Symp. Comp. Geom. ACM (1985) 147–152Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Hutchinson Joan P. 
    • 1
  1. 1.Department of Mathematics and Computer ScienceMacalester College St. PaulUSA

Personalised recommendations