On Representations of Some Thickness-Two Graphs

@inproceedings{Hutchinson1995OnRO,
  title={On Representations of Some Thickness-Two Graphs},
  author={Joan P. Hutchinson and Thomas C. Shermer and Andrew Vince},
  booktitle={Graph Drawing},
  year={1995}
}
This paper considers representations of graphs as rectangle-visibility graphsand asdoubly linear graphs . These are, respectively, graphs whose vertices are isothetic rectangles in the plane with adjacency determined by horizontal and vertical visibility, and graphs that can be drawn as the union of two straight-edged planar graphs. We prove that these graphs have, with n vertices, at most 6 n− 20 (respectively, 6 n− 18) edges, and we provide examples of these graphs with 6 n− 20 edges for each… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 50 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 18 references

On rectangle visibility graphs III

T. Shermer
external visibility and complexity, in: Proc. 8th Canad. Conf. Comput. Geom. 1996, Carleton University Press, Ottawa • 1996

On representations of some thickness-two graphs

J. P. Hutchinson, T. Shermer, A. Vince
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
View 1 Excerpt

Coloring ordinary maps

J. P. Hutchinson
maps of empires, and maps of the Moon, Math. Magazine 66 • 1993
View 2 Excerpts

Art Gallery Theorems and Algorithms

J. O’Rourke
1987
View 1 Excerpt

Characterizing bar line-of-sight graphs

Symposium on Computational Geometry • 1985
View 2 Excerpts

Computational Aspects of VLSI Design

J. D. Ullman
Computer Science Press, Rockville, MD • 1984
View 1 Excerpt

Similar Papers

Loading similar papers…