Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness

Dean, Alice M. and Evans, William and Gethner, Ellen and Laison, Joshua D. and Safari, Mohammad Ali and Trotter, William T. (2006) Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness. In: Graph Drawing 13th International Symposium, GD 2005, September 12-14, 2005, Limerick, Ireland , pp. 73-82 (Official URL: http://dx.doi.org/10.1007/11618058_7).

Full text not available from this repository.

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.

Item Type:Conference Paper
Additional Information:10.1007/11618058_7
Classifications:P Styles > P.900 Visibility
ID Code:681

Repository Staff Only: item control page

References

T. Andreae: Some results on visibility graphs, Discrete Appl. Math, 40(1), 5--17 1992

P. Bose and A. Dean and J. Hutchinson and T. Shermer: On rectangle visibility graphs, Lecture Notes in Computer Science 1190: Graph Drawing, Springer-Verlag, 1997, pages 25--44

G. Chen and J. P. Hutchinson and K. Keating and J. Shen: Characterizations of 1,k-bar visibility trees, 2005, In preparation

A. Dean and W. Evans and E. Gethner and J. D. Laison and

M. A. Safari and W. T. Trotter: Bar k-Visibilty Graphs, 2005, Submitted

A. M. Dean and E. Gethner and J. P. Hutchinson: A characterization of triangulated polygons that are unit Bar-Visibility Graphs, 2005, In preparation

A. M. Dean and E. Gethner and J. P. Hutchinson: Unit Bar-visibility Layouts of Triangulated Polygons: Extended Abstract, Lecture Notes in Computer Science 3383: Graph Drawing 2004, Springer-Verlag, 111--121, 2005

A. M. Dean and J. P. Hutchinson: Rectangle-visibility representations of bipartite graphs, Discrete Appl. Math., 75 (1), 1997, 9--25

A. M. Dean and J. P. Hutchinson: Rectangle-visibility layouts of unions and products of trees, J. Graph Algorithms Appl., 2 (no. 8, 21 pp. (electronic), 1998

G. Di Battista and P.Eades and R. Tamassia and I. G. Tollis Graph Drawing, Prentice Hall, 1999

M. R. Garey and D. S. Johnson and H. C. So, Hing: An application of graph coloring to printed circuit testing, IEEE Trans. Circuits and Systems, CAS-23, 1976 (10), 591--599

J. P. Hutchinson: Arc- and circle-visibility graphs, Australas. J. Combin., 25, 2002, 241--262

J. P. Hutchinson and T. Shermer and A. Vince: On representations of some thickness-two graphs, Computational Geometry, 1999, 13, 161--171

P. Rosenstiehl and R. E. Tarjan: Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom., 1 (4), 1986, 343--353

T. Shermer: On rectangle visibility graphs III. External visibility and complexity, Proc. 8th Canad. Conf. on Comp. Geom., 1996, 234--239

I. Streinu, and S. Whitesides, Sue: Rectangle visibility graphs: characterization, construction and compaction, STACS 2003, Lecture Notes in Computer Science 2607, 26--37, 2003

R. Tamassia and I. Tollis:A unified approach to visibility representations of planar graphs, Discrete Comput. Geom., 1 (4), 1986, 321--341

D. B. West: Introduction to Graph Theory, Prentice Hall Inc., 2001

S. K. Wismath: Characterizing Bar Line-of-Sight Graphs, Proceedings of the First Symposium of Computational Geometry, 1985, 147--152