Rectangle-visibility representations of bipartite graphs

Discrete Applied Mathematics

Volumn 75, Issue 1, 1997, Pages 9-25

  Dean, Alice M ^a   Hutchinson, Joan P ^b  

^a SKIDMORE COLLEGE   (United States)

^b MACALESTER COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038356941     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00029-7     Document Type: Article

References (17)

1. T. Andreae, Some results on visibility graphs, Discrete Appl. Math. 40 (1992) 5-18.
2. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (American Elsevier, NY 1976).
3. 42 is a box visibility graph, Tech. Report #034, Smith College 1994.
4. A.M. Dean and J.P. Hutchinson, Combinatorial representations of visibility graphs, preprint.
5. A.M. Dean and J.P. Hutchinson, Rectangle-visibility representations of bipartite graphs, extended abstract, in: R. Tamassia and I.G. Tollis, eds., Lecture Notes in Computer Science, Vol. 894 (Proc. DIMACS Workshop Graph Drawing, 1994) (Springer, Berlin, 1995).
6. A.M. Dean and R.B. Richter, personal communication.
7. M.R. Garey, D.S. Johnson and H.C. So, An application of graph coloring to printed circuit testing, IEEE Trans. Circuits and Systems CAS-23 (1976) 591-599.
8. J.P. Hutchinson Coloring ordinary maps, maps of empires, and maps of the Moon, Math. Mag. 66 (1993) 211-226.
9. J.P. Hutchinson, T. Shermer and A. Vince, On representations of some thickness-two graphs, extended abstract, in: F. Brandenburg, ed., Lecture Notes in Computer Science, Vol. 1027 (Proc. University of Passau Workshop Graph Drawing, 1995) (Springer, Berlin, 1996).
10. D.G. Kirkpatrick and S.K. Wismath, Weighted visibility graphs of bars and related flow problems, in: Lecture Notes in Computer Science, Vol. 382 (Proc. 1st Workshop Algorithms Data Struct.) (Springer, Berlin, 1989) 325-334.
11. F. Luccio, S. Mazzone and C.K. Wong, A note on visibility graphs, Discrete Math. 64 (1987) 209-219.
12. A. Mansfield, Determining the thickness of graphs is NP-hard, Math. Proc. Cambridge Philos. Soc. 93 (1983) 9-23.
13. H. Meijer, personal communication.
14. J. O'Rourke, Art Gallery Theorems and Algorithms (Oxford University Press, NY, 1987).
15. T. Shermer, personal communication.
16. R. Tamassia and I.G. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1 (1986) 321-341.
17. S.K. Wismath, Characterizing bar line-of-sight graphs, in: Proc. 1st ACM Symp. Comput. Geom. (1985) 147-152.