gdea_3Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and ThicknessAlice M.DeanauthorWilliamEvansauthorEllenGethnerauthorJoshua D.LaisonauthorMohammad AliSafariauthorWilliam T.TrotterauthorLet 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. Z.999 Others2006SpringerConference Paper

For work being deposited by its own author: In self-archiving this collection of files and associated bibliographic metadata, I grant gdea the right to store them and to make them permanently available publicly for free on-line. I declare that this material is my own intellectual property and I understand that gdea does not assume any responsibility if there is any breach of copyright in distributing these files or metadata. (All authors are urged to prominently assert their copyright on the title page of their work.)

For work being deposited by someone other than its author: I hereby declare that the collection of files and associated bibliographic metadata that I am archiving at gdea) is in the public domain. If this is not the case, I accept full responsibility for any breach of copyright that distributing these files or metadata may entail.

Clicking on the deposit button indicates your agreement to these terms.