Abstract
Let S be a set of horizontal line segments, or bars, in the plane. We say that G is a bar visibility graph, and S its bar visibility representation, if there exists a one-to-one correspondence between vertices of G and bars in S, such that there is an edge between two vertices in G if and only if there exists an unobstructed vertical line of sight between their corresponding bars. If bars are allowed to see through each other, the graphs representable in this way are precisely the interval graphs. We consider representations in which bars are allowed to see through at most k other bars. Since all bar visibility graphs are planar, we seek measurements of closeness to planarity for bar k-visibility graphs. We obtain an upper bound on the number of edges in a bar k-visibility graph. As a consequence, we obtain an upper bound of 12 on the chromatic number of bar 1-visibility graphs, and a tight upper bound of 8 on the size of the largest complete bar 1-visibility graph. We conjecture that bar 1-visibility graphs have thickness at most 2.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Andreae, T.: Some results on visibility graphs. Discrete Appl. Math. 40(1), 5–17 (1992); Combinatorial methods in VLSI
Bose, P., Dean, A., Hutchinson, J., Shermer, T.: On rectangle visibility graphs. In: North, S.C. (ed.) GD 1996. LNCS, vol. 1190, pp. 25–44. Springer, Heidelberg (1997)
Chen, G., Hutchinson, J.P., Keating, K., Shen, J.: Characterizations of 1,k-bar visibility trees (2005) (in preparation)
Dean, A., Evans, W., Gethner, E., Laison, J.D., Safari, M.A., Trotter, W.T.: Bar k-visibilty graphs (2005) (submitted)
Dean, A.M., Gethner, E., Hutchinson, J.P.: A characterization of triangulated polygons that are unit bar-visibility graphs (2005) (in preparation)
Dean, A.M., Gethner, E., Hutchinson, J.P.: Unit bar-visibility layouts of triangulated polygons: Extended abstract. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 111–121. Springer, Heidelberg (2005)
Dean, A.M., Hutchinson, J.P.: Rectangle-visibility representations of bipartite graphs. Discrete Appl. Math. 75(1), 9–25 (1997)
Dean, A.M., Hutchinson, J.P.: Rectangle-visibility layouts of unions and products of trees. J. Graph Algorithms Appl. 2(8), 21 (1998) (electronic)
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing, p. 397. Prentice Hall Inc., Upper Saddle River, NJ (1999)
Garey, M.R., Johnson, D.S., So, H.C.: An application of graph coloring to printed circuit testing. IEEE Trans. Circuits and Systems CAS-23(10), 591–599 (1976)
Hutchinson, J.P.: Arc- and circle-visibility graphs. Australas. J. Combin. 25, 241–262 (2002)
Hutchinson, J.P., Shermer, T., Vince, A.: On representations of some thickness-two graphs. Computational Geometry 13, 161–171 (1999)
Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1(4), 343–353 (1986)
Shermer, T.: On rectangle visibility graphs III. External visibility and complexity. In: Proc. 8th Canad. Conf. on Comp. Geom., pp. 234–239 (1996)
Streinu, I., Whitesides, S.: Rectangle visibility graphs: characterization, construction, and compaction. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol. 2607, pp. 26–37. Springer, Heidelberg (2003)
Tamassia, R., Tollis, I.G.: A unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1(4), 321–341 (1986)
West, D.B.: Introduction to Graph Theory, 2E. Prentice Hall Inc., Upper Saddle River, NJ (2001)
Wismath, S.K.: Characterizing bar line-of-sight graphs. In: Proceedings of the First Symposium of Computational Geometry, pp. 147–152. ACM, New York (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dean, A.M., Evans, W., Gethner, E., Laison, J.D., Safari, M.A., Trotter, W.T. (2006). Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness. In: Healy, P., Nikolov, N.S. (eds) Graph Drawing. GD 2005. Lecture Notes in Computer Science, vol 3843. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11618058_7
Download citation
DOI: https://doi.org/10.1007/11618058_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31425-7
Online ISBN: 978-3-540-31667-1
eBook Packages: Computer ScienceComputer Science (R0)