On rectangle visibility graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1190, Issue , 1997, Pages 25-44

  Bose, Prosenjit ^a   Dean, Alice ^b   Hutchinson, Joan ^c   Shermer, Thomas ^d  

^a UNIVERSITÉ DU QUÉBEC À TROIS RIVIÈRES   (Canada)

^b Skidmore College   (India)

^c Macalester College   (India)

^d SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GEOMETRY; VISIBILITY;

INDEPENDENT SET; K-TREES; LAYOUT ALGORITHMS; LINEAR TIME; MAXIMUM DEGREE; VERTICAL LINES; VISIBILITY GRAPHS;

GRAPH THEORY;

EID: 84957706945     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62495-3_35     Document Type: Conference Paper

References (14)

1. T. Biedl. personal communication, 1995.
2. P. Cose, A. Dean, a. Hutchinson, and T. Shermer. On rectangle visibility graphs I. k-trees and caterpillar forests, manuscript, 1996.
3. A. M. Dean and J. P. Hutchinson. Combinatorial representations of visibility graphs, preprint, 1996.
4. A. M. Dean and J. P. Hutchinson. Rectangle-visibility representations of bipartite graphs. Discrete Applied Mathematics, 1996, to appear.
5. P. Duchet, Y. Hamidoune, M. Las Vergnas, and H. Meyniel. Representing a planar graph by vertica, lines joining different levels. Discrete Mathematics, 46:319-321, 1983.
6. M. R. Garey, D. S. Johnson, and H. C. So. An application of graph coloring to printed circuit testing. IEEE Transactions on Circuits and Systems, CAS-23:591-99, 1976.
7. P. Horak, and L. Niepeh A short proof of a linear arboricity theorem for cubic graphs. Acta Math. Univ. Comenian., XL-XLI:255-277, 1982.
8. J. P. Hutchinson, T. Shermer, and A. Vince. On representations of some thicknesstwo graphs (extended abstract). In F. Brandenburg, editor, Proc. of Workshop on Graph Drawing, volume 1027 of Lecture Notes in Computer Science. Springer-Varlet, 1995.
9. F. Luccio, S. Mazzone, and C. K. Wong. A note on visibility graphs. Discrete Mathematics, 64:209-219, 1987.
10. T. C. Shermer. On rectangle visibility graphs II. k-hilly and maximum-degree 4. manuscript, 1996.
11. T. C. Shermer. On rectangle visibility graphs III. external visibility and complexity. manuscript, 1996.
12. R. Tamassia and I.G. Tollis. A unified approach to visibility representations of planar graphs. Discrete and Computational Geometry, 1:321-341, 1986.
13. S. K. Wismath. Characterizing bar line-of-sight graphs. In Proc. 1st Syrup. Comp. Geom., pages 147-152. ACM, 1985.
14. S. K. Wismath. Bar-Representable Visibility Graphs and a Related Network Flow Problem. PhD thesis, Department of Computer Science, University of British Columbia, 1989.