Geodesic
Bar k-Visibility Graphs
Journal of Graph Algorithms and Applications, Tome 11 (2007) no. 1, pp. 45-59.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

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 also consider the thickness of bar k-visibility graphs, obtaining an upper bound of 4 when k=1, and a bound that is quadratic in k for k > 1. 
@article{JGAA_2007_11_1_a1,
     author = {Alice Dean and William Evans and Ellen Gethner and Joshua Laison and Mohammad Ali Safari and William Trotter},
     title = {Bar {k-Visibility} {Graphs}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {45--59},
     publisher = {mathdoc},
     volume = {11},
     number = {1},
     year = {2007},
     doi = {10.7155/jgaa.00136},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00136/}
}
TY  - JOUR
AU  - Alice Dean
AU  - William Evans
AU  - Ellen Gethner
AU  - Joshua Laison
AU  - Mohammad Ali Safari
AU  - William Trotter
TI  - Bar k-Visibility Graphs
JO  - Journal of Graph Algorithms and Applications
PY  - 2007
SP  - 45
EP  - 59
VL  - 11
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00136/
DO  - 10.7155/jgaa.00136
LA  - en
ID  - JGAA_2007_11_1_a1
ER  - 
%0 Journal Article
%A Alice Dean
%A William Evans
%A Ellen Gethner
%A Joshua Laison
%A Mohammad Ali Safari
%A William Trotter
%T Bar k-Visibility Graphs
%J Journal of Graph Algorithms and Applications
%D 2007
%P 45-59
%V 11
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00136/
%R 10.7155/jgaa.00136
%G en
%F JGAA_2007_11_1_a1
Alice Dean; William Evans; Ellen Gethner; Joshua Laison; Mohammad Ali Safari; William Trotter. Bar k-Visibility Graphs. Journal of Graph Algorithms and Applications, Tome 11 (2007) no. 1, pp. 45-59. doi : 10.7155/jgaa.00136. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00136/

Cité par Sources :