On representations of some thickness-two graphs

Computational Geometry: Theory and Applications

Volumn 13, Issue 3, 1999, Pages 161-171

  Hutchinson, Joan P ^a   Shermer, Thomas ^b   Vince, Andrew ^c  

^a MACALESTER COLLEGE   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITY OF FLORIDA   (United States)

Author keywords

Doubly linear graph; Rectangle visibility graph

Indexed keywords

EID: 0042709989     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00018-8     Document Type: Article

References (22)

1. J. Battle, F. Harary, Y. Kodama, Every planar graph with nine points has a nonplanar complement, Bull. Amer. Math. Soc. 68 (1962) 569-571.
2. P. Bose, A. Dean, J.P. Hutchinson, T. Shermer, On rectangle visibility graphs, in: S. North (Ed.), Graph Drawing, Lecture Notes in Computer Science, Vol. 1190, Proc. of Symp. on Graph Drawing GD '96, September 1996, Berkeley, CA, Springer, Berlin, 1997, pp. 25-44.
3. A. Dean, J.P. Hutchinson, Rectangle-visibility representations of bipartite graphs, Extended Abstract, in: R. Tamassia, I.G. Tollis (Eds.), Lecture Notes in Computer Science, Vol. 894, Proc. DIMACS Workshop Graph Drawing, 1994, Springer, Berlin, 1995, pp. 159-166.
4. A. Dean, J.P. Hutchinson, Rectangle-visibility representations of bipartite graphs, Discrete Appl. Math. 75 (1) (1997) 9-25.
5. A. Dean, J.P. Hutchinson, Rectangle-visibility layouts of unions and products of trees, J. Graph Algorithms Appl. 2 (1998) 1-21.
6. M. Gardner, Mathematical games, Scientific American 242 (1980) 14-19.
7. M.R. Garey, D.S. Johnson, H.C. So, An application of graph coloring to printed circuit testing, IEEE Trans. Circuits Syst. 23 (1976) 591-599.
8. J.P. Hutchinson, Coloring ordinary maps, maps of empires, and maps of the Moon, Math. Magazine 66 (1993) 211-226.
9. J.P. Hutchinson, T. Shermer, A. Vince, On representations of some thickness-two graphs, Extended Abstract, in: F. Brandenburg (Ed.), Lecture Notes in Computer Science, Vol. 1027, Symposium on Graph Drawing DG '95, Passau, Germany, September 1995, Springer, Berlin, 1996, pp. 324-332.
10. D.G. Kirkpatrick, S.K. Wismath, Weighted visibility graphs of bars and related flow problems, in: Proc. 1st Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 382, Springer, Berlin, 1989, pp. 325-334.
11. A. Mansfield, Determining the thickness of graphs is NP-hard, Math. Proc. Cambridge Philos. Soc. 93 (1983) 9-23.
12. H. Meijer, Personal communication.
13. J. O'Rourke, Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987.
14. G. Ringel, Färbungsproblems auf Flächen und Graphen, Deutscher Verlag, Berlin, 1959.
15. T. Shermer, On rectangle visibility graphs III, external visibility and complexity, in: Proc. 8th Canad. Conf. Comput. Geom. 1996, Carleton University Press, Ottawa, 1996, pp. 234-239.
16. T. Shermer, On rectangle visibility graphs II, K-hilly and maximum-degree 4, in preparation.
17. E. Steinitz, H. Rademacher, Vorlesungen über die Theorie der Polyeder, Springer, Berlin, 1934.
18. R. Tamassia, I.G. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1 (1986) 321-341.
19. W.T. Tutte, On the non-biplanar character of the complete 9-graph, Canad. Math. Bull. 6 (1963) 319-330.
20. W.T. Tutte, The thickness of a graph, Indag. Math. 25 (1963) 567-577.
21. J.D. Ullman, Computational Aspects of VLSI Design, Computer Science Press, Rockville, MD, 1984.
22. S.K. Wismath, Characterizing bar line-of-sight graphs, in: Proc. 1st Symp. Comput. Geom., ACM, 1985, pp. 147-152.