Unit rectangle visibility graphs

Electronic Journal of Combinatorics

Volumn 15, Issue 1, 2008, Pages

  Dean, Alice M ^a   Ellis Monaghan, Joanna A ^b   Hamilton, Sarah ^b   Pangborn, Greta ^b  

^a SKIDMORE COLLEGE   (United States)

^b SAINT MICHAEL'S COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 45749114118     PISSN: None     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/803     Document Type: Article

References (17)

1. P. Bose, A. Dean, J. Hutchinson, and T. Shermer. On rectangle visibility graphs. In Lecture Notes in Computer Science 1190: Graph Drawing, pages 25-44. Springer-Verlag, London, UK, 1997.
2. 42 is a box visibility graph. Technical Report #034, Smith College, 1994.
3. A. M. Dean, E. Gethner, and J. P. Hutchinson. Unit bar-visibility layouts of triangulated polygons: Extended abstract. In Lecture Notes in Computer Science 3383: Graph Drawing, pages 111-121. Springer-Verlag, London, UK, 2005.
4. A. M. Dean and J. P. Hutchinson. Rectangle-visibility representations of bipartite graphs. In GD '94: Proceedings of the DIMACS International Workshop on Graph Drawing, pages 159-166, London, UK, 1995. Springer-Verlag.
5. A. M. Dean and N. Veytsel. Unit bar-visibility graphs. Congressus Numerantium, 160:161-175, 2003.
6. P. Duchet, Y. Hamidoune, M. Las Vergnas, and H. Meyniel. Representing a planar graph by vertical lines joining different levels. Discrete Mathematics, 46:319-321, 1983.
7. P. Erdös and A. Szekeres. A combinatorial problem in geometry. Compositio Mathematica, 2:463-470, 1935.
8. S. P. Fekete and H. Meijer. Rectangle and box visibility graphs in 3D. International Journal of Computational Geometry and Applications, 9(1):1-21, 1999.
9. J. P. Hutchinson, T. Shermer, and A. Vince. On representations of some thickness-two graphs. Computational Geometry, 13:161-171, 1999.
10. B. Peroche. Complexité de l'arboricité lineaire d'un graphe. RAIRO Recherche Opérationnelle, 16(2):125-129, 1982.
11. P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete and Computational Geometry, 1(4):343-353, 1986.
12. M. Schlag, F. Luccio, P. Maestrini, D. Lee, and C. Wong. A visibility problem in VLSI layout compaction. In F. Preparata, editor, Advances in Computing Research, volume 2, pages 259-282. JAI Press Inc., Greenwich, CT, 1985.
13. T. Shermer. On rectangle visibility graphs II: k-hilly and maximum-degree 4. Manuscript, 1996.
14. T. Shermer. On rectangle visibility graphs III: external visibility and complexity. In Proceedings of the 8th Canadian Conference on Computational Geometry, pages 234-239. Carleton University Press, 1996.
15. I. Streinu and S. Whitesides. Rectangle visibility graphs: Characterization, construction, and compaction. In STACS '03: Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, pages 26-37, London, UK, 2003. Springer-Verlag.
16. R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete and Computational Geometry, 1(4):321-341, 1986.
17. S. K. Wismath. Characterizing bar line-of-sight graphs. In SCG '85: Proceedings of the First Annual Symposium on Computational Geometry, pages 147-152, New York, NY, USA, 1985. ACM Press.